Full Text:   <1411>

Summary:  <883>

CLC number: TP393

On-line Access: 2016-12-13

Received: 2015-12-31

Revision Accepted: 2016-02-29

Crosschecked: 2016-11-08

Cited: 0

Clicked: 3607

Citations:  Bibtex RefMan EndNote GB/T7714

 ORCID:

Da-fang Zhang

http://orcid.org/0000-0001-7049-9945

-   Go to

Article info.
Open peer comments

Frontiers of Information Technology & Electronic Engineering  2016 Vol.17 No.12 P.1266-1274

http://doi.org/10.1631/FITEE.1500499


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


Author(s):  Da-fang Zhang, Dan Chen, Yan-biao Li, Kun Xie, Tong Shen

Affiliation(s):  College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China; more

Corresponding email(s):   dfzhang@hnu.edu.cn, danchen@hnu.edu.cn

Key Words:  Virtual routers, Merging, Splitting, Compression, Fast refactoring


Da-fang Zhang, Dan Chen, Yan-biao Li, Kun Xie, Tong Shen. A splitting-after-merging approach to multi-FIB compression and fast refactoring in virtual routers[J]. Frontiers of Information Technology & Electronic Engineering, 2016, 17(12): 1266-1274.

@article{title="A splitting-after-merging approach to multi-FIB compression and fast refactoring in virtual routers",
author="Da-fang Zhang, Dan Chen, Yan-biao Li, Kun Xie, Tong Shen",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="17",
number="12",
pages="1266-1274",
year="2016",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.1500499"
}

%0 Journal Article
%T A splitting-after-merging approach to multi-FIB compression and fast refactoring in virtual routers
%A Da-fang Zhang
%A Dan Chen
%A Yan-biao Li
%A Kun Xie
%A Tong Shen
%J Frontiers of Information Technology & Electronic Engineering
%V 17
%N 12
%P 1266-1274
%@ 2095-9184
%D 2016
%I Zhejiang University Press & Springer
%DOI 10.1631/FITEE.1500499

TY - JOUR
T1 - A splitting-after-merging approach to multi-FIB compression and fast refactoring in virtual routers
A1 - Da-fang Zhang
A1 - Dan Chen
A1 - Yan-biao Li
A1 - Kun Xie
A1 - Tong Shen
J0 - Frontiers of Information Technology & Electronic Engineering
VL - 17
IS - 12
SP - 1266
EP - 1274
%@ 2095-9184
Y1 - 2016
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.1500499


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.

虚拟化路由器中基于融合再拆分的多表压缩及快速重构机制

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

关键词:虚拟化路由器;融合;拆分;压缩;快速重构机制

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Reference

[1]Bando, M., Chao, H.J., 2010. FlashTrie: hash-based prefix-compressed trie for IP route lookup beyond 100 Gbps. Proc. IEEE INFOCOM, p.1-9.

[2]Bao, J., Chen, Y., Yu, J.S., 2010. A regeneratable dynamic differential evolution algorithm for neural networks with integer weights. J. Zhejiang Univ. Sci. C (Comput. & Electron.), 11(12):939-947.

[3]Bass, B.M., Calvignac, J.L., Heddes, M.C., et al., 2005. Longest Prefix Match (LPM) Algorithm Implementation for a Network Processor. US Patent 7 383 244.

[4]Broder, A., Mitzenmacher, M., 2001. Using multiple hash functions to improve IP lookups. Proc. IEEE INFOCOM, p.1454-1463.

[5]Chan, C.Y., Ioannidis, Y.E., 1998. Bitmap index design and evaluation. Proc. ACM SIGMOD Int. Conf. on Management of Data, p.355-366.

[6]Degermark, M., Brodnik, A., Carlsson, S., et al., 1997. Small forwarding tables for fast routing lookups. ACM SIGCOMM Comput. Commun. Rev., 27(4):3-14.

[7]Eatherton, W.N., Dittia, Z., 2003. Data Structure Using a TREE Bitmap and Method for Rapid Classification of Data in a Database. US Patent 6;728;732.

[8]Eatherton, W., Varghese, G., Dittia, Z., 2004. Tree bitmap: hardware/software IP lookups with incremental updates. ACM SIGCOMM Comput. Commun. Rev., 34(2):97-122.

[9]Fu, J., Rexford, J., 2008. Efficient IP-address lookup with a shared forwarding table for multiple virtual routers. ACM CoNEXT Conf., p.21.

[10]Fu, Z., Wu, S.F., Huang, H., et al., 2001. IPSec/VPN security policy: correctness, conflict detection, and resolution. Proc. Int. Workshop on Policies for Distributed Systems & Networks, p.39-56.

[11]Han, B., Gopalakrishnan, V., Ji, L.S., et al., 2015. Network function virtualization: challenges and opportunities for innovations. IEEE Commun. Mag., 53(2):90-97.

[12]Huang, K., Xie, G.G., Li, Y.B., et al., 2011. Offset addressing approach to memory-efficient IP address lookup. Proc. IEEE INFOCOM, p.306-310.

[13]Kobayashi, M., Murase, T., Kuriyama, A., 2000. A longest prefix match search engine for multi-gigabit IP processing. IEEE Int. Conf. on Communications, p.1360-1364.

[14]Le, H., Ganegedara, T., Prasanna, V.K., 2011. Memory-efficient and scalable virtual routers using FPGA. Proc. 19th ACM/SIGDA Int. Symp. on Field Programmable Gate Arrays, p.257-266.

[15]Li, X.L., Wang, H.M., Guo, C.G., et al., 2012. Topology awareness algorithm for virtual network mapping. J. Zhejiang Univ.-Sci. C (Comput. & Electron.), 13(3): 178-186.

[16]Li, Y.B., Zhang, D.F., Huang, K., et al., 2014. A memory-efficient parallel routing lookup model with fast updates. Comput. Commun., 38(1):60-71.

[17]Liu, J., Huang, T., Chen, J.Y., et al., 2011. A new algorithm based on the proximity principle for the virtual network embedding problem. J. Zhejiang Univ. Sci. C (Comput. & Electron.), 12(11):910-918.

[18]Luo, L.Y., Xie, G.G., Salamatian, K., et al., 2013. A trie merging approach with incremental updates for virtual routers. Proc. IEEE INFOCOM, p.1222-1230.

[19]McKeown, N., Anderson, T., Balakrishnan, H., et al., 2008. OpenFlow: enabling innovation in campus networks. ACM SIGCOMM Comput. Commun. Rev., 38(2):69-74.

[20]Nilsson, S., Karlsson, G., 1999. IP-address lookup using LC-tries. IEEE J. Sel. Areas Commun., 17(6):1083-1092.

[21]Rekhter, Y., Li, T., 1994. A Border Gateway Protocol 4 (BGP-4). RFC 1654, T.J. Watson Research Center & CISCO.

[22]Richardson, N.J., Rajgopal, S., Huang, L.B., 2002. Method for Increasing Storage Capacity in a Multi-bit Trie-Based Hardware Storage Engine by Compressing the Representation of Single-Length Prefixes. US Patent 7;162;481.

[23]Saravanan, K., Senthilkumar, A., 2015. An efficient parallel prefix matching architecture using Bloom filter for multi-bit trie IP lookup algorithm in FPGA. Optoelectron. Adv. Mat.-Rap. Commun., 9(5):803-807.

[24]Sezer, S., Scott-Hayward, S., Chouhan, P.K., et al., 2013. Are we ready for SDN? Implementation challenges for software-defined networks. IEEE Commun. Mag., 51(7):36-43.

[25]Song, H.Y., Turner, J., Lockwood, J., 2005. Shape shifting tries for faster IP route lookup. IEEE Int. Conf. on Network Protocols, p.358-367.

[26]Song, H.Y., Kodialam, M., Hao, F., et al., 2009. Scalable IP lookups using shape graphs. 17th IEEE Int. Conf. on Network Protocols, p.73-82.

[27]Song, H.Y., Kodialam, M., Hao, F., et al., 2010. Building scalable virtual routers with trie braiding. Proc. IEEE INFOCOM, p.1-9.

[28]Song, H.Y., Kodialam, M., Hao, F., et al., 2012. Efficient trie braiding in scalable virtual routers. IEEE/ACM Trans. Netw., 20(5):1489-1500.

[29]Srinivasan, V., Varghese, G., 1999. Fast address lookups using controlled prefix expansion. ACM Trans. Comput. Syst., 17(1):1-40.

[30]Wang, Z., Chen, H.F., Xie, L., et al., 2010. Retransmission in the network-coding-based packet network. J. Zhejiang Univ.-Sci. C (Comput. & Electron.), 11(7):544-554.

[31]Wu, K.S., Otoo, E.J., Shoshani, A., 2006. Optimizing bitmap indices with efficient compression. ACM Trans. Database Syst., 31(1):1-38.

[32]Xie, G.G., He, P., Guan, H.T., et al., 2011. PEARL: a programmable virtual router platform. IEEE Commun. Mag., 49(7):71-77.

[33]Yu, H., Mahapatra, R., Bhuyan, L., 2009. A hash-based scalable IP lookup using Bloom and fingerprint filters. Proc. 17th IEEE Int. Conf. on Network Protocols, p.264-273.

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - Journal of Zhejiang University-SCIENCE