Abstract
Fast routing lookups are crucial for the forwarding performance of IP routers. Longest prefix match makes routing lookups difficult. This paper proposes a method to partition a routing table. The method can divide all prefixes in a routing table into several prefix sets where prefixes don’t overlap. Based on the method, this paper also presents a common parallel lookup framework(PRLF) that reduces ”longest prefix matching” in all the prefixes to ”only prefix matching” in several prefix sets. The framework can effectively simplify the design of lookup algorithms and improve lookup performance. The framework is suitable for most lookup algorithms. For simple binary search algorithm, the framework can reach log 22N/B lookup complexity (where N is prefix number in a routing table and B is an integer bigger than 4). Also, the framework can scale to IPv6 easily.
Supported by: (1) the National Natural Science Foundation of China (No. 90104002; No. 69725003); (2) the National Basic Research Program of China No. 2003CB314801.
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
Vince, et al.: Classless Inter-Domain Routing (CIDR): an address assignment and aggregation strategy, RFC1519 (1993)
Hinden, R., Deering, S.: IP Version 6 Addressing Architecture, RFC 2373 (1998)
Lampson, B., Srinivasan, V., Varghese, G.: IP Lookups Using Multiway and Multicolumn Search. IEEE/ACM Transactions on Networking 7(3), 324–334 (1999)
Waldvogel, M., et al.: Scalable High Speed IP Routing Lookups. In: Proceedings of ACM SIGCOMM 1997, Cannes, France (1997)
Srinivasan, V., Varghese, G.: Fast IP Lookups Using Controlled Prefix Expansion. IEEE/ACM Transactions on Computer Systems 17(1), 1–40 (1999)
Akhbarizadeh, M.J., NouraniAn, M.: An IP Packet Forwarding Technique Based on Partitioned Lookup Table. In: Proceedings of IEEE ICC (2002)
Ioannidis, I., Grama, A.: Mikhail Atallah Adaptive Data Structures for IP Lookups. In: Proceeding of IEEE INFOCOMM (2003)
Dharmapurikar, S., Krishnamurthy, P., et al.: Longest Prefix Matching using Bloom Filters. In: Proceedings of ACM SIGCOMM (2003)
Michigan University, Merit Network, Internet performance and analysis (IPMA) Project. Available WWW: http://www.merit.edu/~ipma
Narlikar, G., Basu, A., ZaneFast, F.: CoolCAMs: Power-Efficient TCAMs for Forwarding Engines. In: Proceedings of IEEE INFOCOMM (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liang, Z., Xu, K., Wu, J. (2004). A Scalable Parallel Lookup Framework Avoiding Longest Prefix Match. In: Kahng, HK., Goto, S. (eds) Information Networking. Networking Technologies for Broadband and Mobile Networks. ICOIN 2004. Lecture Notes in Computer Science, vol 3090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25978-7_62
Download citation
DOI: https://doi.org/10.1007/978-3-540-25978-7_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23034-2
Online ISBN: 978-3-540-25978-7
eBook Packages: Springer Book Archive