A splitting-after-merging approach to multi-FIB compression and fast refactoring in virtual routers  

作　　者：Da-fang ZHANG Dan CHEN Yan-biao LI Kun XIE Tong SHEN 

机构地区：[1]College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China [2]Department of Electrical and Computer Engineering, State University of New York, New York 11790, USA

出　　处：《Frontiers of Information Technology & Electronic Engineering》2016年第12期1266-1274,共9页信息与电子工程前沿（英文版）

基　　金：Project supported by the National Basic Research Program （973） of China （No. 2012CB315805）, the National Natural Science Foundation of China （Nos. 61173167 and 61472130）, the Prospective Research Project on Future Networks of Jiangsu Future Networks Innovation Institute, China （No. 2013095-1-05）, the Hunan Provincial Innovation Foundation for Postgraduate, China （No. CX2014B150）, and the State Scholarship Fund of China （No. 201406130048）

摘　　要：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.在未来互联网研究领域中,虚拟化路由器受到越来越多的关注。作为实现网络虚拟化的关键路由设备,虚拟化路由器在一个物理路由平台基础上拥有多个虚拟路由实例,每一个路由实例维护自己的转发表。因此,有限的片上存储限制了存储的扩展性。本文中,我们提出一种基于融合再拆分的方法,用于压缩多个转发表,不仅提高了存储效率,同时为快速系统重构过程提供了一个理想的拆分位置。另外,本文提出了一种优化策略,用于减少快速系统重构的时间。实验表明,我们的方案在处理14个真实路由数据集时,只需要一棵134 188个结点的单步长特里树,而原始方案中需要4 569 133个结点。同时,我们的方案在扩展性中表现出良好的性能,能够支持90 000 000条前缀以及65 600个转发表。

关 键 词：Virtual routers MERGING SPLITTING Compression Fast refactoring 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]