Longest Prefix Match and updates in Range Tries
暂无分享,去创建一个
[1] Gunnar Karlsson,et al. IP-address lookup using LC-tries , 1999, IEEE J. Sel. Areas Commun..
[2] Sartaj Sahni,et al. A B-tree dynamic router-table design , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).
[3] Walid Dabbous,et al. Survey and taxonomy of IP address lookup algorithms , 2001, IEEE Netw..
[4] George F. Gilder,et al. Telecosm: How Infinite Bandwidth Will Revolutionize Our World , 2000 .
[5] Yung-Chieh Lin,et al. Dynamic Segment Trees for Ranges and Prefixes , 2007, IEEE Transactions on Computers.
[6] V. Srinivasan,et al. Fast address lookups using controlled prefix expansion , 1999, TOCS.
[7] George Varghese,et al. Multiway range trees: scalable IP lookup with fast updates , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[8] Ioannis Sourdis,et al. Range Tries for scalable address lookup , 2009, ANCS '09.
[9] Hayato Musa. SMALL FORWARDING TABLES FOR FAST ROUTING LOOKUPS , 2011 .
[10] George Varghese,et al. Tree bitmap: hardware/software IP lookups with incremental updates , 2004, CCRV.