A small and fast IP forwarding table using hashing

IEICE Transactions on Communications

Volumn E88-B, Issue 1, 2005, Pages 239-246

  Chang, Yeim Kuan ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Binary trie; Hash table; IP lookup

Indexed keywords

APPLICATION SPECIFIC INTEGRATED CIRCUITS; NETWORK PROTOCOLS; OPTIMIZATION; PACKET NETWORKS; ROUTERS;

BINARY TRIE; HASH TABLE; IP LOOKUP;

INTERNET;

EID: 27544437532     PISSN: 09168516     EISSN: 17451345     Source Type: Journal    
DOI: 10.1093/ietcom/E88-B.1.239     Document Type: Article

References (15)

1. M.A. Ruiz-Sanchez, E.W. Biersack, and W. Dabbous, "Survey and taxonomy of IP address lookup algorithms," IEEE Netw. Mag., vol.15, no.2, pp.8-23, March/April 2001.
2. N.F. Huang, S.M. Zhao, J.Y. Pan, and C.A. Su, "A fast IP routing lookup scheme for gigabit switching routers," Proc. INFOCOM 99, pp. 1429-1436, March 1999.
3. B. Lampson, V. Srinivasan, and G. Varghese, "IP lookups using multiway and multicolumn search," IEEE/ACM Trans. Netw., vol.3, no.3, pp.324-334, 1999.
4. G. Huston, "Analysis of the Internet's BGP routing table," Internet Protocol Journal, vol.4, no.1, pp.2-15, March 2001.
5. S. Nilsson and G. Karlsson, "IP-address lookup using LC-tries," IEEE J. Sel. Areas Commun., vol.17, no.6, pp.1083-1092, June 1999.
6. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small for-warding tables for fast routing lookups," ACM SIGCOMM, Palais des Festivals, pp.3-14, Cannes, France, 1997.
7. K. Sklower, "A tree-based packet routing table for berkeley unix," Proc. 1991 Winter Usenix Conf. pp.93-99, 1991.
8. P. Gupta, S. Lin, and N. McKeown, "Routing lookups in hardware at memory access speeds," Proc. INFOCOM 99, pp. 1240-1247, March 1999.
9. D. Meyer, "University of Oregon route views archive project: Oixdamp-snapshot-2002-12-01-0000.dat.gz," http://archive.routeviews.org/
10. V. Srinivasan and G. Varghese, "Fast address lookups using controlled prefix expansion," ACM Trans. Comput. Syst., vol.17, no.1, pp. 1-40, Feb. 1999.
11. S. Sahni and K.S. Kim, "Efficient construction of multibit tries for IP lookup," IEEE/ACM Trans. Netw., vol. 11, no.4, pp.650-662, 2003.
12. D. Morrison, "PATRICIA-Practical algorithm to retreive information coded in alfanumeric," J. ACM, vol.15, no.4, pp.514-534, Oct. 1968.
13. A. Andersson and S. Nilsson, "Improved behaviour of tries by adaptive branching," Inf. Process. Lett., vol.46, no.6, pp.295-300, 1993.
14. P. Crescenzi, L. Dardini, and R. Grossi, "IP address lookup made fast and simple," 7th Annual Euro. Symp. Algorithms;
15. also, Technical Report TR-99-01 Univ. di Pisa, 1999.