A network traffic awareness architecture for universal redundancy elimination

Redundancy elimination has become a hot spot in recent years. Several papers have explored systems operating at the application layer, while more recent systems operate on individual packets. These systems focus on the improvement on link load and network efficiency with redundancy elimination. This paper presents the findings about performance of their algorithm realizing in practice. We explore a traffic-aware intra-domain routing protocols and analyze the time parameters in it. Using synthetic traces, we show that the routing computation time is nearly linear to the number of egress nodes in the network, on the basis of which we derive the lowest bound of routing computation interval N. Moreover, we also design a mechanism to deal with the traffic surge. The network-wide benefits can be further enhanced by applying trigger mode when a traffic surge occurs. We level the difference of link latency and set strategies of routing paths recalculation accordingly to offer better performance under sudden traffic variations.