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

Fu, Jing; Rexford, Jennifer

doi:10.1145/1544012.1544033

Cited by 57 publications

(77 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The number of unique NHs is small due to the limited number of interfaces in a router. One can assume that this number is less than 256 [7], so that a 1-byte NH pointer can represent the NH. Therefore, storing the NH pointers in the associated SRAM instead of the complete NHs consumes much less memory.…”

Section: Traditional Tcam-based Ip Lookupmentioning

confidence: 99%

“…The prefix set in the merged FIB consists of the union of the prefixes in the individual FIBs, and is henceforth called the Union Prefix Set (UPS). To get the UPS from multiple FIBs, we adopt the trie merging approach proposed in [7].…”

Section: Merged Data Structurementioning

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%

See 2 more Smart Citations

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

Section: Traditional Tcam-based Ip Lookupmentioning

confidence: 99%

Section: Merged Data Structurementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

show abstract

“…The Trie Overlay scheme [27] and Trie Braiding scheme [28] have been proposed to build a compact shared trie data structure for a large number of virtual routers. Orthogonal to these studies, our offset encoding scheme can be used to compress the trie data structure of a single virtual router.…”

Section: Introductionmentioning

confidence: 99%

Offset addressing approach to memory-efficient IP address lookup

Huang

Xie

et al. 2011

2011 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-This paper presents a novel offset encoding scheme for memory-efficient IP address lookup, called Offset Encoded Trie (OET). Each node in the OET contains only a next hop bitmap and an offset value, without the child pointers and the next hop pointers. Each traversal node uses the next hop bitmap and the offset value as two offsets to determine the location address of the next node to be searched. The on-chip OET is searched to find the longest matching prefix, and then the prefix is used as a key to retrieve the corresponding next hop from an off-chip prefix hash table. Experiments on real IP forwarding tables show that the OET outperforms previous multi-bit trie schemes in terms of the memory consumption. The OET facilitates the far more effective use of on-chip memory for faster IP address lookup.

show abstract

“…mapping relationship between the virtual router and physical network in the same logical network is more than one, it is affected by the transmission cost of [5], such as delay, link cost, …”

mentioning

confidence: 99%