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

Article
  • 39 Downloads

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.

Key words

Virtual routers Merging Splitting Compression Fast refactoring 

CLC number

TP393 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bando, M., Chao, H.J., 2010. FlashTrie: hash-based prefixcompressed trie for IP route lookup beyond 100 Gbps. Proc. IEEE INFOCOM, p.1–9. http://dx.doi.org/10.1109/INFCOM.2010.5462142Google Scholar
  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. http://dx.doi.org/10.1631/jzus.C1000137CrossRefGoogle Scholar
  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.Google Scholar
  4. Broder, A., Mitzenmacher, M., 2001. Using multiple hash functions to improve IP lookups. Proc. IEEE INFOCOM, p.1454–1463. http://dx.doi.org/10.1109/INFCOM.2001.916641Google Scholar
  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. http://dx.doi.org/10.1145/276304.276336Google Scholar
  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. http://dx.doi.org/10.1145/263109.263133CrossRefGoogle Scholar
  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.Google Scholar
  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. http://dx.doi.org/10.1145/997150.997160CrossRefGoogle Scholar
  9. Fu, J., Rexford, J., 2008. Efficient IP-address lookup with a shared forwarding table for multiple virtual routers. ACM CoNEXT Conf., p.21. http://dx.doi.org/10.1145/1544012.1544033Google Scholar
  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.CrossRefGoogle Scholar
  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. http://dx.doi.org/10.1109/MCOM.2015.7045396CrossRefGoogle Scholar
  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. http://dx.doi.org/10.1109/INFCOM.2011.5935151Google Scholar
  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. http://dx.doi.org/10.1109/ICC.2000.853719Google Scholar
  14. Le, H., Ganegedara, T., Prasanna, V.K., 2011. Memoryefficient and scalable virtual routers using FPGA. Proc. 19th ACM/SIGDA Int. Symp. on Field Programmable Gate Arrays, p.257–266.Google Scholar
  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. http://dx.doi.org/10.1631/jzus.C1100282CrossRefGoogle Scholar
  16. Li, Y.B., Zhang, D.F., Huang, K., et al., 2014. A memoryefficient parallel routing lookup model with fast updates. Comput. Commun., 38(1):60–71. http://dx.doi.org/10.1016/j.comcom.2013.10.005CrossRefGoogle Scholar
  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. http://dx.doi.org/10.1631/jzus.C1100003CrossRefGoogle Scholar
  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. http://dx.doi.org/10.1109/INFCOM.2013.6566914Google Scholar
  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. http://dx.doi.org/10.1145/1355734.1355746CrossRefGoogle Scholar
  20. Nilsson, S., Karlsson, G., 1999. IP-address lookup using LCtries. IEEE J. Sel. Areas Commun., 17(6):1083–1092. http://dx.doi.org/10.1109/49.772439CrossRefGoogle Scholar
  21. Rekhter, Y., Li, T., 1994. A Border Gateway Protocol 4 (BGP-4). RFC 1654, T.J. Watson Research Center & CISCO.CrossRefGoogle Scholar
  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.Google Scholar
  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.Google Scholar
  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. http://dx.doi.org/10.1109/MCOM.2013.6553676CrossRefGoogle Scholar
  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. http://dx.doi.org/10.1109/ICNP.2005.36Google Scholar
  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. http://dx.doi.org/10.1109/ICNP.2009.5339697Google Scholar
  27. Song, H.Y., Kodialam, M., Hao, F., et al., 2010. Building scalable virtual routers with trie braiding. Proc. IEEE INFOCOM, p.1–9. http://dx.doi.org/10.1109/INFCOM.2010.5461960Google Scholar
  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. http://dx.doi.org/10.1109/TNET.2011.2181412CrossRefGoogle Scholar
  29. Srinivasan, V., Varghese, G., 1999. Fast address lookups using controlled prefix expansion. ACM Trans. Comput. Syst., 17(1):1–40. http://dx.doi.org/10.1145/296502.296503CrossRefGoogle Scholar
  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. http://dx.doi.org/10.1631/jzus.C0910475CrossRefGoogle Scholar
  31. Wu, K.S., Otoo, E.J., Shoshani, A., 2006. Optimizing bitmap indices with efficient compression. ACM Trans. Database Syst., 31(1):1–38. http://dx.doi.org/10.1145/1132863.1132864CrossRefGoogle Scholar
  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. http://dx.doi.org/10.1109/MCOM.2011.5936157CrossRefGoogle Scholar
  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. http://dx.doi.org/10.1109/ICNP.2009.5339676Google Scholar

Copyright information

© Journal of Zhejiang University Science Editorial Office and Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.College of Computer Science and Electronic EngineeringHunan UniversityChangshaChina
  2. 2.Department of Electrical and Computer EngineeringState University of New YorkNew YorkUSA

Personalised recommendations