Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
IEEE Internet Computing
BGP routing stability of popular destinations
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Observed structure of addresses in IP traffic
IEEE/ACM Transactions on Networking (TON)
OpenFlow: enabling innovation in campus networks
ACM SIGCOMM Computer Communication Review
On the cost of caching locator/ID mappings
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Revisiting Route Caching: The World Should Be Flat
PAM '09 Proceedings of the 10th International Conference on Passive and Active Network Measurement
Making routers last longer with ViAggre
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Long-range dependence in a changing Internet traffic mix
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Long range dependent trafic
Experimental evaluations of algorithms for IP table minimization
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Network prefix-level traffic profiling: Characterizing, modeling, and evaluation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient FIB caching using minimal non-overlapping prefixes
ACM SIGCOMM Computer Communication Review
Hi-index | 0.00 |
Modern Internet routers require powerful forwarding facilities to cope with extremely high rate Forwarding Information Base (FIB) lookups. In general, the FIB is constrained to a small highly efficient but expensive memory. Unfortunately, the BGP route table (RIB) keeps increasing, and this subsequently results in severe FIB inflation at BGP routers. What if we only load a small portion of the RIB into the FIB? Recently the route caching mechanism has been revisited. With such a route caching mechanism, the optimal method is to load in a FIB with popular prefixes which contribute major traffic loads. We propose a prediction based method to catch those popular prefixes with a limited cache size. In this paper, the dynamics of popular prefixes has been studied based on real traffic traces from different ISPs. On applying a GM(1,1) model which is widely applied in grey system control and prediction, we propose a traffic prediction-based route caching method which attempts to bias the cache dump strategy with a range of history to ameliorate the effects of bursts from non-popular prefixes. We also suggest applying FIB aggregation techniques, e.g. Optimal Routing Table Constructor (ORTC) algorithm, to suppress the number of non-popular sub-prefixes of the popular prefixes on route updates. The evaluation of our method is based on simulation over real traffic traces. The simulation shows our prediction-based cache replacement strategy outperforms other cache strategies and matches Internet traffic dynamics very well.