Abstract
An IP router must forward packets at gigabit speed in order to guarantee a good QoS. Two important factors make this task a challenging problem: (i) for each packet, the longest matching preffix in the forwarding table must be computed; (ii) the routing tables contain several thousands of entries and their size grows significantly every year. Because of this, parallel routers have been developed which use several processors to forward packets. In this work, we present a novel algorithmic technique which, for the first time, exploits the parallelism of the router to also reduce the size of the routing table. Our method is scalable and requires onlya minimal additional hardware. Indeed, we prove that any IP routing table T can be split into two subtables T 1 and T 2 such that: (a) |T 1| can be any positive integer k ≤ |T| and |T 2| ≤ |T| ∑ k; (b) the two routing tables can be used separately by two processors so that the IP lookup on T is obtained by simply XOR-ing the IP lookup on the two tables. Our method is independent on the data structure used to implement the lookup search and it allows for a better use of the processors L2 cache. For real routers routing tables, we also show how to achieve simultaneously: (a) |T 1| is roughly 7% of the original table T; (b) the lookup on table T 2 does not require the best matching preffix computation.
Research supported by the European project CRESCCO.
Most of this work has been done while at the University of Rome “Tor Vergata”, Math Department.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Bellovin, R. Bush, T.G. Griffin, and J. Rexford. Slowing routing table growth by filtering based on address allocation policies. http://www.research.att.com/~jrex/, June 2001.
G. Bongiovanni and P. Penna. XOR-based schemes for fast parallel IP lookups. Technical report, University of Salerno, 2003. Electronically available at http://www.dia.unisa.it/~penna.
T. Bu, L. Gao, and D. Towsley. On Routing Table Growth. In Proceedings of Globe Internet, 2002.
P. Crescenzi, L. Dardini, and R. Grossi. IP address lookup made fast and simple. In Proc. 7th Annual European Symposium on Algorithms, volume 1643 of LNCS, 1999.
S. Deering and R. Hinden. Internet protocol, version 6 (IPv6). RFC 1883, 1995.
M. Degernark, A. Brodnik, S. Carlesson, and S. Pink. Small forwarding tables for fast routing lookups. ACM Computer Communication Review, 27(4):3–14, 1997.
DIGITAL, http://www.networks.europe.digital.com/html/products guide/hpswch3.html. GIGAswitch/FDDI networking switch, 1995.
V. Fuller, T. Li, J. Yu, and K. Varadhan. Classless Inter-Domain Routing (CIDR): and address assignment and aggregation strategy. RFC 1519, September 1993.
N. Huang, S. Zhao, and J. Pan C. Su. A Fast IP Routing Lookup Scheme for Gigabit Switching Routers. In IEEE INFOCOM, 2002.
G. Huston. Analyzing the Internet’s BGP Routing Table. The Internet Protocol Journal, 4(1), 2001.
C. Labovitz, G.R. Malan, and F. Jahanian. Origins of Internet Routing Instability. In IEEE INFOCOM, 1999.
B. Lampson, V. Srinivasan, and G. Varghese. IP Lookups using Multi-way and Multicolumn Search. In INFOCOM, 1998.
A. McAuley, P. Tsuchiya, and D. Wilson. Fast multilevel hierarchical routing table using content-adressable memory. US Patent Serial Number 034444, 1995.
MERIT, ftp://ftp.merit.edu/ipma/routing_table. IPMA statistices, 2002.
M. Mitzenmacher and A. Broder. Using Multiple Hash Functions to Improve IP Lookups. In IEEE INFOCOM, 2001.
P. Newman, G. Minshall, T. Lyon, and L. Huston. IP Switching and Gigabit Routers. IEEE Communications Magazine, January 1997.
S. Nilsson and G. Karlsson. Fast address look-up for internet routers. Proc. of ALEX, pages 42–50, February 1998.
D. Pao, C. Liu, A. Wu, L. Yeung, and K.S. Chan. Efficient Hardware Architecture for Fast IP Adress Lookup. In IEEE INFOCOM, 2002.
C. Partridge, P. Carvey, E. Burgess, I. Castineyra, T. Clarke, L. Graham, M. Hathaway, P. Herman, A. King, S. Kohalmi, T. Ma, J. Mcallen, T. Mendez, W.C. Miller, R. Pettyjohn, J. Rokosz, J. Seeger, M. Sollins, S. Storch, B. Tober, G.D. Troxel, and S. Winterble. A 50-Gb/s IP router. IEEE/ACM Transactions on Networking, 6(3):237–247, 1998.
T.-B. Pei and C. Zukowski. Putting routing tables into silicon. IEEE Network, January 1992.
Pluris Inc., White Paper, http://www.pluris.com. Pluris Massively Parallel Routing.
J. Postel. J. Internet protocol. RFC 791, 1981.
V. Srinivasan and G. Varghese. Faster IP Lookups using Controlled Preffix Expansion. In Proc. of ACM SIGMETRICS (also in ACM TOCS 99), pages 1–10, September 1998.
D.E. Taylor, J.W. Lockwood, T.S. Sroull, J.S. Turner, and D.B. Parlour. Scalable IP Lookup for Programmable Routers. In IEEE INFOCOM, 2002.
M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. Scalable High Speed IP Routing Lookups. In Proc. of ACM SIGCOMM, pages 25–36, September 1997.
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
Bongiovanni, G., Penna, P. (2003). XOR-Based Schemes for Fast Parallel IP Lookups. In: Petreschi, R., Persiano, G., Silvestri, R. (eds) Algorithms and Complexity. CIAC 2003. Lecture Notes in Computer Science, vol 2653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44849-7_28
Download citation
DOI: https://doi.org/10.1007/3-540-44849-7_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40176-6
Online ISBN: 978-3-540-44849-5
eBook Packages: Springer Book Archive