Fast binary and multiway prefix searches for packet forwarding

Computer Networks

Volumn 51, Issue 3, 2007, Pages 588-605

  Chang, Yeim Kuan ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Binary search; CPU caches; Longest prefix match; Routing table

Indexed keywords

COMPUTER SIMULATION; DATA TRANSFER; INTERNET; NETWORK PROTOCOLS; ROUTERS; TELECOMMUNICATION LINKS;

BINARY SEARCH; DYNAMIC ROUTING; LONGEST PREFIX MATCH; ROUTING TABLES;

PACKET NETWORKS;

EID: 33751232321     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2006.05.005     Document Type: Article

References (26)

1. A. Basu, G. Narlikar, Fast incremental updates for pipelined forwarding engines, in: Proceedings of INFOCOM 2003.
2. CERNET BGP VIEW Global Internet, http://bgpview.6test.edu.cn/.
3. Chang Y. A small IP forwarding table using hashing. IEICE Transactions on Communication E88-B 1 (2005) 239-246
4. T. Chiueh, P. Pradhan, High performance IP routing table lookup using CPU caching, in: INFOCOM, 1999, pp. 1421-1428.
5. M. Degermark, A. Brodnik, S. Carlsson, S. Pink, Small forwarding tables for fast routing lookups, in: ACM SIGCOMM, 1997, pp. 3-14.
6. P. Gupta, S. Lin, N. McKeown, Routing lookups in hardware at memory access speeds, in: INFOCOM, 1998, pp. 1240-1247.
7. N.F. Huang, S.M. Zhao, J.Y. Pan, C. A.Su, A fast IP routing lookup scheme for gigabit switching routers, in: Proc. INFOCOM, 1999.
8. Huston G. Analysis of the Internet's BGP routing table. Internet Protocol Journal 4 1 (2001)
9. M. Akhbarizadeh, M. Nourani, IP routing based on partitioned lookup table, in: Proceedings of the IEEE International Conference on Communications (ICC), April 2002, pp. 2263-2267.
10. Intel Corporation, IA-32 Intel Architecture Software Developer Manual Volume 2 - Instruction Set Reference, 2003.
11. C. Labovitz, G. Malan, F. Jahanian, Internet routing instability, in: Proceedings of ACM Sigcomm, September 1997, pp. 115-126.
12. Lampson B., Srinivasan V., and Varghese G. IP lookups using multiway and multicolumn search. IEEE/ACM Transactions on Networking 3 3 (1999) 324-334
13. Lu H., and Sahni S. Enhanced interval trees for dynamic IP router-tables. IEEE Transactions on Computers 53 12 (2004) 1615-1628
14. Lu H., and Sahni S. O(log n) dynamic router-tables for prefixes and ranges. IEEE Transactions on Computers 53 10 (2004) 1217-1230
15. D. Meyer, University of Oregon Route Views Archive Project: oix-damp-snapshot-2002-12-01-0000.dat.gz, http://archive.routeviews.org/.
16. Nilsson S., and Karlsson G. IP-address lookup using LC-tries. IEEE Journal on Selected Areas in Communications 17 6 (1999) 1083-1092
17. Ruiz-Sanchez M.A., Biersack E.W., and Dabbous W. Survey and taxonomy of IP address lookup algorithms. IEEE Network Magazine 15 2 (2001) 8-23
18. Sahni S., and Kim K.S. Efficient construction of multibit tries for IP lookup. IEEE/ACM Transactions on Networking 11 4 (2003) 650-662
19. Sahni S., and Kim K. O(log n) dynamic router-table design. IEEE Transactions on Computers 53 3 (2004) 351-363
20. Srinivasan V., and Varghese G. Fast address lookups using controlled prefix expansion. ACM Transactions on Computer Systems 17 1 (1999) 1-40
21. Sun X., and Zhao Y.Q. An on-chip IP address lookup algorithm. IEEE Transactions on Computers 54 7 (2005)
22. S. Suri, G. Varghese, P.R. Warkhede, Multiway range trees: scalable IP lookup with fast updates, in: Global Com 2001.
23. N. Yazdani, P.S. Min, Fast and scalable schemes for the IP address lookup problem, in: Proceedings of IEEE High Performance Switching and Routing 2000.
24. F. Zane, G. Narlikar, A. Basu, CoolCAMs: Power-efficient TCAMs for forwarding engines, in: Proceedings of IEEE INFOCOM, 2003.
25. M. Waldvogel, G. Varghese, J. Turner, B. Plattner, High Speed Scalable IP Lookups, in: Proceedings of ACM SIGCOMM'97, Cannes, France, September 1997.
26. F. Baker, Requirements for IP Version 4 Routers, RFC 1812, June 1995.