Building Scalable Virtual Routers with Trie Braiding

Song, Haoyu; Kodialam, Murali; Hao, Fang; Lakshman, T. V.

doi:10.1109/infcom.2010.5461960

Cited by 36 publications

(45 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A key issue in virtual routers is to perform IP lookup with multiple FIBs using limited on-chip memory. Several schemes have been proposed to compress multiple FIBs [18,21,37].…”

Section: Related Workmentioning

confidence: 99%

Guarantee IP lookup performance with FIB explosion

Yang

Xie

et al. 2014

Proceedings of the 2014 ACM Conference on SIGCOMM

View full text Add to dashboard Cite

The Forwarding Information Base (FIB) of backbone routers has been rapidly growing in size. An ideal IP lookup algorithm should achieve constant, yet small, IP lookup time and on-chip memory usage. However, no prior IP lookup algorithm achieves both requirements at the same time. In this paper, we first propose SAIL, a Splitting Approach to IP Lookup. One splitting is along the dimension of the lookup process, namely finding the prefix length and finding the next hop, and another splitting is along the dimension of prefix length, namely IP lookup on prefixes of length less than or equal to 24 and IP lookup on prefixes of length longer than 24. Second, we propose a suite of algorithms for IP lookup based on our SAIL framework. Third, we implemented our algorithms on four platforms: CPU, FPGA, GPU, and many-core. We conducted extensive experiments to evaluate our algorithms using real FIBs and real traffic from a major ISP in China. Experimental results show that our SAIL algorithms are several times or even two orders of magnitude faster than well known IP lookup algorithms.

show abstract

“…A key issue in virtual routers is to perform IP lookup with multiple FIBs using limited on-chip memory. Several schemes have been proposed to compress multiple FIBs [18,21,37].…”

Section: Related Workmentioning

confidence: 99%

Guarantee IP lookup performance with FIB explosion

Yang

Xie

et al. 2014

Proceedings of the 2014 ACM Conference on SIGCOMM

View full text Add to dashboard Cite

show abstract

“…However, this scheme works well only when the original tries are similar. To address this issue, Song et al [18] propose trie braiding, which enables each trie node to swap its left and right sub-tries freely. Hence, the shape of dissimilar tries can be adjusted and these tries can become as similar as possible.…”

Section: Related Workmentioning

confidence: 99%

“…In the last few years, the scalability challenge brought by virtual routers has created interest from the research community, and previous work [7][8][9][10]18] mainly focused on SRAM-based scalable virtual routers. Tree-based (e.g., trie or 2-3 tree) algorithms have been proposed to merge multiple FIBs into a single tree, and thereby many FIBs can be efficiently stored in the SRAMs.…”

Section: Introductionmentioning

confidence: 99%

Towards TCAM-based scalable virtual routers

Luo

Xie

Uhlig

et al. 2012

Proceedings of the 8th International Conference on Emerging Networking Experiments and Technologies

View full text Add to dashboard Cite

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 small amount of high-speed memory in a physical router platform severely limits the number of FIBs supported, which leads to a scalability challenge. In this paper, we present a method towards TCAM (Ternary Content Addressable Memory) based scalable virtual routers, through a merged data structure that enables the sharing of prefixes from several FIBs in TCAMs. Based on this data structure, we propose two approaches to merge multiple FIBs in TCAMs, paving the way for scalable virtual routers. Experimental results show that, by using the two approaches for storing 14 full IPv4 FIBs, the TCAM memory requirement can be reduced by about 92% and 82% respectively, compared with the conventional approach of treating FIBs as independent entities.

show abstract

“…Several ideas have been proposed to realize router virtualization on a single hardware networking platform [2,6,12,18,22]. These ideas mainly focus on how to implement a memory-efficient virtualized router, while guaranteeing the basic requirements of network virtualization.…”

Section: Network Virtualizationmentioning

confidence: 99%

Memory-efficient and scalable virtual routers using FPGA

Ganegedara

Prasanna

2011

Proceedings of the 19th ACM/SIGDA International Symposium on Field Programmable Gate Arrays

View full text Add to dashboard Cite

Router virtualization has recently gained much interest in the research community. It allows multiple virtual router instances to run on a common physical router platform. The key metrics in designing network virtual routers are: (1) number of supported virtual router instances, (2) total number of prefixes, and (3) ability to quickly update the virtual table. Limited on-chip memory in FPGA leads to the need for memory-efficient merging algorithms. On the other hand, due to high frequency of combined updates from all the virtual routers, the merging algorithms must be highly efficient. Hence, the router must support quick updates. In this paper, we propose a simple merging algorithm whose performance is not sensitive to the number of routing tables considered. The performance solely depends on the total number of prefixes. We also propose a novel scalable, highthroughput linear pipeline architecture for IP-lookup that supports large virtual routing tables and quick non-blocking update. Using a state-of-the-art Field Programmable Gate Array (FPGA) along with external SRAM, the proposed architecture can support up to 16M IPv4 and 880K IPv6 prefixes. Our implementation shows a sustained throughput of 400 million lookups per second, even when external SRAM is used.

show abstract

Building Scalable Virtual Routers with Trie Braiding

Cited by 36 publications

References 26 publications

Guarantee IP lookup performance with FIB explosion

Guarantee IP lookup performance with FIB explosion

Towards TCAM-based scalable virtual routers

Memory-efficient and scalable virtual routers using FPGA

Contact Info

Product

Resources

About