Journal Home Online First Current Issue Archive For Authors Journal Information 中文版

2016, Volume 17, Issue 12

Abstract

Keywords

Related Research

Back to Top

Frontiers of Information Technology & Electronic Engineering >> 2016, Volume 17, Issue 12 doi: 10.1631/FITEE.1500499

Asplitting-after-merging approach tomulti-FIB compression and fast refactoring in virtual routers

. College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China.. Department of Electrical and Computer Engineering, State University of New York, New York 11790, USA

Available online: 2016-12-29
HTML23 PDF 2 Collect 0

Next Previous

Abstract

Virtual routers are gaining increasing attention in the research field of future networks. As the core network device to achieve network virtualization, virtual routers have multiple virtual instances coexisting on a physical router platform, and each instance retains its own forwarding information base (FIB). Thus, memory scalability suffers from the limited on-chip memory. In this paper, we present a splitting-after-merging approach to compress the FIBs, which not only improves the memory efficiency but also offers an ideal split position to achieve system refactoring. Moreover, we propose an improved strategy to save the time used for system rebuilding to achieve fast refactoring. Experiments with 14 real-world routing data sets show that our approach needs only a unibit trie holding 134 188 nodes, while the original number of nodes is 4 569 133. Moreover, our approach has a good performance in scalability, guaranteeing 90 000 000 prefixes and 65 600 FIBs.

Related Research