Abstract
This paper introduces a new data structure to perform forwarding lookups at Gigabit speed by condensing the forwarding table of backbone routers to fit into cache, eliminating slow memory accesses. The proposed structure bases on the conventional trie, which is good at partial string search. Each link in the proposed trie denotes some portion of IP address and a node also holds a pointer to a routing entry when the entry’s destination is equal to the concatenation of IP prefixes assigned over the link path down to the node. For reduction of the trie’s size, our trie encodes a set of child and routing entry pointers as a bit array where a single bit represents a pointer. So, we call this proposed structure bitmap trie. The experiments show that the bitmap trie compacts backbone routing table small enough for 512Kbyte L2 cache.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Keith Sklower: A Tree-Based Routing Table for Berkeley Unix, Technical report. University of California, Berkeley
Tong-Bi Pei and Charles Zukowski: Putting Routing Tables in Silicon. IEEE network Magazine (1992)
A.J. McAuley and P. Francis: Fast routing table lookup using CAMs. Proc. IEEE Infocom’ 93, San Francisco (1993) 1382–1391
Anthony J. Bloomfeld NJ McAuley, Paul F. Lake Hopatcong NJ Tsuchiya, and Daniel V. Rockaway Township Morris Country NJ Wilson: Fast Multilevel hierarchical routing table using content-addressable memory. U.S. Patent serial number 034444
P. Gupta (eds): Routing Lookups in Hardware at Memory Speeds. Proc. IEEE Infocom’ 98, San Francisco (1998)
A. Bremler-Barr, Y. Afek, and S. Har-Peled: Routing with Clue. Proc. ACM SIGCOMM 99, Cambridge (1999)
Rosen, E., Viswanathan, A. and R. Callon: Multiprotocol Label Switching Architecture. RFC 3031 (2001)
Donald R. Morrison: PATRICIA-Practical Algorithm to Retrieve Information Coded In Alfanumeric. Journal of the ACM, 15(4) (1968), 514–534
Mikael Degermark, Andrej Brodnik, Svante Carlsson, and Stephen pink: Small Forwarding Tables for Fast Routing Lookups. Proc. ACM SIGCOMM’ 97 (1997)
B. Lampson, V. Srinivasan and G. Varghese: IP Lookups using Multiway and Multicolumn Search. Proc. INFOCOM’ 98 (1998)
S. Venkatachary and G. Varghese: Faster IP Lookups using Controlled Prefix Expansion. Proc. ACM Sigmetrics’ 98 (1998)
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, Data Structure and Algorithms. Addison-Wesley (1983)
T. Kijkanjanarat and H.J. Chao: Fast IP Lookups using a Two-Trie Data Structure. Proc. Globecom’ 99 (1999)
Pinar A. Yilmaz, Andrey Belenkiy, Necdet Uzun, and Nitin Gogate: A Trie-based Algorithm for IP Lookup Problem. Proc. Globecom’ 00 (2000)
Michigan University and merit Network. Internet Performance Management and Analysis (IPMA) project. http://nic.merit.edu/~ipma
Marcel Waldvogel, George Varghese, Jon Turner, and Bernhard Plattner: Scalable High Speed IP Routing Lookups. In Proceedings of ACM SIGCOMM’97 (1997)
S. Nilsson and G. karlsson: Fast Address Look-Up for Internet Routers. In Proceedings of IEEE Broadband Communications’98 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oh, S., Lee, Y. (2003). The Bitmap Trie for Fast Prefix Lookup. In: Chung, CW., Kim, CK., Kim, W., Ling, TW., Song, KH. (eds) Web and Communication Technologies and Internet-Related Social Issues — HSI 2003. HSI 2003. Lecture Notes in Computer Science, vol 2713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45036-X_57
Download citation
DOI: https://doi.org/10.1007/3-540-45036-X_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40456-9
Online ISBN: 978-3-540-45036-8
eBook Packages: Springer Book Archive