Efficient FIB caching using minimal non-overlapping prefixes

Computer Communication Review

Volumn 43, Issue 1, 2013, Pages 14-21

  Liu, Yaoqing ^a   Amin, Syed Obaid ^a   Wang, Lan ^a  

^a University of Memphis   (United States)

Author keywords

FIB caching; Routing; Scalability

Indexed keywords

CACHE MISS; CACHE REPLACEMENT; CACHING SCHEME; FAST MEMORY; FIB CACHING; GLOBAL ROUTING; HIT RATIO; INFORMATION BASE; LINE CARD; MEMORY CAPACITY; MEMORY MODULES; POTENTIAL SOLUTIONS; RAPID GROWTH; ROUTING;

ROUTERS; SCALABILITY;

CACHE MEMORY;

EID: 84872462240     PISSN: 01464833     EISSN: 19435819     Source Type: Conference Proceeding    
DOI: 10.1145/2427036.2427039     Document Type: Review

References (17)

1. Advanced Network Technology Center at University of Oregon. The RouteViews project. http://www.routeviews.org/.
2. M. J. Akhbarizadeh and M. Nourani. Efficient prefix cache for network processors. In Proceedings of the High Performance Interconnects, 2004.
3. R. Draves, C. King, S. Venkatachary, and B. D. Zill. Constructing Optimal IP Routing Tables. In Proc. IEEE INFOCOM, 1999.
4. V. Fuller. Scaling Issues with Routing+Multihoming. http: //www.vaf.net/vaf/apricot-plenary.pdf, 1996.
5. K. Gadkari, D. Massey, and C. Papadopoulos. Dynamics of prefix usage at an edge router. In Proceedings of the 12th international conference on Passive and active measurement, PAM'11, 2011.
6. C. Kim, M. Caesar, A. Gerber, and J. Rexford. Revisiting route caching: The world should be flat. In Proceedings of the 10th International Conference on Passive and Active Network Measurement, PAM '09, 2009.
7. T. Li. Preliminary Recommendation for a Routing Architecture. RFC 6115, 2011.
8. H. Liu. Routing prefix caching in network processor design. In in Tenth International Conference on Computer Communications and Networks, 2001.
9. Y. Liu, X. Zhao, K. Nam, L. Wang, and B. Zhang. Incremental forwarding table aggregation. In Proc. IEEE Globecom, 2010.
10. D. Meyer, L. Zhang, and K. Fall. Report from the IAB Workshop on Routing and Addressing. RFC 4984, 2007.
11. D. R. Morrison. PATRICIA-practical algorithm to retrieve information coded in alphanumeric. J. ACM, 15(4):514-534, Oct. 1968.
12. J. Rexford, J. Wang, Z. Xiao, and Y. Zhang. BGP routing stability of popular destinations. In Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment, IMW '02, 2002.
13. G. Trotter. Terminology for Forwarding Information Base (FIB) based Router Performance. RFC 3222, 2001.
14. Z. A. Uzmi, M. Nebel, A. Tariq, S. Jawad, R. Chen, A. Shaikh, J. Wang, and P. Francis. SMALTA: practical and near-optimal FIB aggregation. In Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies, CoNEXT '11, 2011.
15. W. Zhang, J. Bi, J. Wu, and B. Zhang. Catching popular prefixes at as border routers with a prediction based method. Comput. Netw., 56(4):1486-1502, Mar. 2012.
16. X. Zhao, Y. Liu, L. Wang, and B. Zhang. On the Aggregatability of Router Forwarding Tables. In Proc. IEEE INFOCOM, 2010.
17. X. Zhao, D. J. Pacella, and J. Schiller. Routing scalability: an operator's view. IEEE Journal on Selected Areas in Communications, 28(8):1262-1270, Oct. 2010.