research-article

Efficient IP-address lookup with a shared forwarding table for multiple virtual routers

Authors:

Jennifer RexfordAuthors Info & Claims

CoNEXT '08: Proceedings of the 2008 ACM CoNEXT Conference

Article No.: 21, Pages 1 - 12

https://doi.org/10.1145/1544012.1544033

Published: 09 December 2008 Publication History

Abstract

Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However, the need to support a separate forwarding information base (FIB) for each virtual router leads to memory scaling challenges. In this paper, we present a small, shared data structure and a fast lookup algorithm that capitalize on the commonality of IP prefixes between each FIB. Experiments with real packet traces and routing tables show that our approach achieves much lower memory requirements and considerably faster lookup times. Our prototype implementation in the Click modular router, running both in user space and in the Linux kernel, demonstrates that our data structure and algorithm are an interesting solution for building scalable routers that support virtualization.

References

[1]

Juniper, Intelligent logical router service, white paper, http://www.juniper.net/solutions/literature/white_papers/200097.pdf, 2004.

[2]

Cisco, Policy-based routing, white paper, http://www.cisco.com/warp/public/732/Tech/plicy_wp.pdf, 1996.

[3]

P. Psenak, S. Mirtorabi, A. Roy, L. Nguyen and P. Pillay-Esnault, "Multi-Topology (MT) Routing in OSPF", IETF RFC 4915, 2007.

[4]

T. Przygienda, N. Shen and N. Sheth, "M-ISIS: Multi Topology (MT) Routing in Intermediate System to Intermediate Systems (IS-ISs)", IETF RFC 5120, 2008.

[5]

R. Alimi, Y. Wang and Y. R. Yang, "Shadow Configuration as a Network Management Primitive," in Proc. of ACM SIGCOMM 2008.

Digital Library

[6]

M. Caesar and J. Rexford, "Building bug-tolerant routers with virtualization", in Proc. of ACM SIGCOMM Workshop on Programmable Routers for Extensible Services of Tomorrow, Aug. 2008.

Digital Library

[7]

T. Anderson, L. Peterson, S. Shenker, J. Turner, "Overcoming the Internet impasse through virtualization," IEEE Computer, vol. 38, no. 4, pp. 34--41, April 2005.

Digital Library

[8]

A. Bavier, N. Feamster, M. Huang, L. Peterson, J. Rexford. "In VINI Veritas: Realistic and Controlled Network Experimentation," in Proc. of ACM SIGCOMM, 2006.

Digital Library

[9]

Route Views Project, University of Oregon. Available: http://www.routeviews.org/.

[10]

S. Nilsson and G. Karlsson, "IP-address lookup using LC-tries," IEEE Journal on Selected Areas in Communications, vol. 17, no. 6, pp. 1083--1092, June 1999.

Digital Library

[11]

M. A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous, "Survey and taxonomy of IP address lookup algorithms," IEEE Network Magazine, vol. 15, no. 2, pp. 8--23, Mar. 2001.

Digital Library

[12]

E. Kohler, R. Morris, B. Chen, J. Jannotti and M. F. Kaashoek, "The Click modular router," ACM Transactions on Computer Systems, August 2000.

Digital Library

[13]

A. McAuley and P. Francis, "Fast Routing table Lookups using CAMs," in Proc. of IEEE Infocom'93, vol. 3, pp. 1382--1391, San Francisco, 1993.

[14]

F. Zane, N. Girija and A. Basu, "CoolCAMs: Power-Efficient TCAMs for Forwarding Engines," in Proc. of IEEE Infocom'03, pp. 42--52, San Francisco, May 2003.

[15]

E. Spitznagel, D. Taylor and J. Turner, "Packet Classification Using Extended TCAMs", in Proc. of ICNP'03, pp. 120--131, Nov. 2003.

Digital Library

[16]

V. Srinivasan and G. Varghese, "Fast Address Lookups Using Controlled Prefix Expansion," ACM Trans. Computer Systems, vol. 17, no. 1, pp. 1--40, Oct. 1999.

Digital Library

[17]

M. Degermark et al., "Small Forwarding Tables for Fast Routing Lookups". in Proc. ACM SIGCOMM Conference'97, pages 3--14, Oct. 1997.

Digital Library

[18]

B. Lampson, V. Srinivasan, and G. Varghese, "IP lookups using multiway and multicolumn search," IEEE/ACM Transactions on Networking (TON), vol. 7, no. 3, pp. 324--334, 1999.

Digital Library

[19]

P. Warkhede, S. Suri, and G. Varghese, "Multiway range trees: scalable IP lookup with fast updates," Computer Networks: The International Journal of Computer and Telecommunications Networking, v.44 n. 3, p. 289--303, Feb. 2004.

Digital Library

[20]

A. Feldmann and S. Muthukrishnan, "Tradeoffs for Packet Classification," in Proc. of INFOCOM, vol. 3, 1193--1202, Mar. 2000.

[21]

J. Fu, O. Hagsand and G. Karlsson, "Improving and Analyzing LC-Trie Performance for IP-Address Lookup," Journal of Networks, vol. 2, June 2007.

[22]

R. Draves, C. King, S. Venkatachary and B. Zill, "Constructing Optimal IP Routing Tables," in Proc. of IEEE Infocom, Mar. 1999.

[23]

E. Fredkin. "Trie memory," Communications of the ACM, pp. 490--499. 1960.

Digital Library

[24]

E. Keller and E. Green, "Virtualizing the Data Plane through Source Code Merging", in Proc. of ACM SIGCOMM Workshop on Programmable Routers for Extensible Services of Tomorrow, Aug. 2008.

Digital Library

[25]

CSC, Finnish IT Center for Science, FUNET Looking Glass, Available: http.//www.csc.fi/sumoi/funet/noc/looking-glass/lg.cgi.

[26]

Swedish University Network (SUNET), Available: http://www.sunet.se and http://stats.sunet.se.

[27]

Emulab, Network Emulation Testbed. Available: http://www.emulab.net.

[28]

SPEC, Standard Performance Evaluation Corporation, Available: http://www.spec.org/.

[29]

OProfile, Available: http://oprofile.sourceforge.net/.

Cited By

Lu JZhao HQi YFeng YGuo XLi SSong EWei XLyu BWen RZhu S(2024)QuarkTable: Building Compact Forwarding Tables for Programmable Switches on Public CloudsProceedings of the 8th Asia-Pacific Workshop on Networking10.1145/3663408.3663415(45-51)Online publication date: 3-Aug-2024
https://dl.acm.org/doi/10.1145/3663408.3663415
Xu KJiang DLi YWang XZhang DXie G(2024)MaP: Increasing node capacity of programmable cloud gatewaysComputer Networks10.1016/j.comnet.2024.110590251(110590)Online publication date: Sep-2024
https://doi.org/10.1016/j.comnet.2024.110590
Yang SCui LDeng XLi QWu YXu MWang DWu J(2020)FISE: A Forwarding Table Structure for Enterprise NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2019.295142617:2(1181-1196)Online publication date: Jun-2020
https://doi.org/10.1109/TNSM.2019.2951426
Show More Cited By

Index Terms

Efficient IP-address lookup with a shared forwarding table for multiple virtual routers

Recommendations

Towards TCAM-based scalable virtual routers
CoNEXT '12: Proceedings of the 8th international conference on Emerging networking experiments and technologies

As the key building block for enabling network virtualization, virtual routers have attracted much attention recently. In a virtual router platform, multiple virtual router instances coexist, each with its own FIB (Forwarding Information Base). The ...
High-performance IP routing table lookup

Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, which complicates the IP lookup. ...
Memory-efficient IP lookup using trie merging for scalable virtual routers

Virtual routers are emerging as a promising way for network virtualization to run multiple virtual router instances in parallel on a common physical platform. The key scalability challenge for IP lookup in virtual routers is to support a large number of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CoNEXT '08: Proceedings of the 2008 ACM CoNEXT Conference

December 2008

526 pages

ISBN:9781605582108

DOI:10.1145/1544012

Conference Chairs:
Arturo Azcorra
IMDEA Networks and University Carlos III of Madrid, Spain
,
Gustavo de Veciana
University Texas at Austin
,
Program Chairs:
Keith W. Ross
Polytechnic University
,
Leandros Tassiulas
University of Thessaly, Greece

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 December 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
503
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)1

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lu JZhao HQi YFeng YGuo XLi SSong EWei XLyu BWen RZhu S(2024)QuarkTable: Building Compact Forwarding Tables for Programmable Switches on Public CloudsProceedings of the 8th Asia-Pacific Workshop on Networking10.1145/3663408.3663415(45-51)Online publication date: 3-Aug-2024
https://dl.acm.org/doi/10.1145/3663408.3663415
Xu KJiang DLi YWang XZhang DXie G(2024)MaP: Increasing node capacity of programmable cloud gatewaysComputer Networks10.1016/j.comnet.2024.110590251(110590)Online publication date: Sep-2024
https://doi.org/10.1016/j.comnet.2024.110590
Yang SCui LDeng XLi QWu YXu MWang DWu J(2020)FISE: A Forwarding Table Structure for Enterprise NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2019.295142617:2(1181-1196)Online publication date: Jun-2020
https://doi.org/10.1109/TNSM.2019.2951426
Yang TXie GLiu AFu QLi YLi XMathy L(2018)Constant IP Lookup With FIB ExplosionIEEE/ACM Transactions on Networking10.1109/TNET.2018.285357526:4(1821-1836)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1109/TNET.2018.2853575
Huang JWang PHuang JWang P(2018)TCAM-Based IP Address Lookup Using Longest Suffix SplitIEEE/ACM Transactions on Networking10.1109/TNET.2018.281599926:2(976-989)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1109/TNET.2018.2815999
Elmonsef Sarhan SSobh MBahaa-Eldin A(2018)Data Inspection in SDN Network2018 13th International Conference on Computer Engineering and Systems (ICCES)10.1109/ICCES.2018.8639202(436-441)Online publication date: Dec-2018
https://doi.org/10.1109/ICCES.2018.8639202
(2016)Building Nemo, a system to monitor IP routing and traffic paths in real timeComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2015.12.01197:C(1-30)Online publication date: 14-Mar-2016
https://dl.acm.org/doi/10.1016/j.comnet.2015.12.011
Huang KXie GLi YZhang D(2015)Memory-efficient IP lookup using trie merging for scalable virtual routersJournal of Network and Computer Applications10.1016/j.jnca.2014.02.00751:C(47-58)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1016/j.jnca.2014.02.007
Bayzelon GYang SXu MLi Q(2015)Multi-dimensional Forwarding TablesFrontiers in Internet Technologies10.1007/978-3-662-46826-5_6(68-79)Online publication date: 18-Apr-2015
https://doi.org/10.1007/978-3-662-46826-5_6
Jiang WPrasanna V(2015)Network Virtualization in Data Centers: A Data Plane PerspectiveHandbook on Data Centers10.1007/978-1-4939-2092-1_10(327-349)Online publication date: 17-Mar-2015
https://doi.org/10.1007/978-1-4939-2092-1_10
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten