Abstract
The decomposition storage of routing tables can effectively alleviate the storage problem caused by the Internet routing expansion. However, the existing researches based on certain routing tables cannot apply to unknown ones or support dynamic changes of routing tables. This paper presents a real-time dynamic decomposition storage model, named RDDS, which takes the IP prefix with 8 bits length mask as a pocket prefix and distributes the routing entries (REs) to different line cards (LCs) according to different pocket prefixes. In the light of the mapping relationship between the destination IP addresses of packets and the pocket prefixes, the forwarding engine determines the host LC of one IP packet and complete forwarding in the LC. RDDS needs a mapping table to locate the host LC in the process of packets forwarding, which only introduces very little logical processing. Therefore, RDDS hardly affect the overall performance of packets forwarding in routers. Experimental results show that RDDS achieves real-time part-storage and the load balancing of REs in LCs. Considering the frequent update of routing tables, RDDS is more significant than other storage models in real environments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
BGP Routing Table Analysis Reports. http://bgp.potaroo.net
Carpenter, B., Crowcroft, J.: IPv4 Address Behaviour Today. RFC 2101, February 1997
Gerich, E.: Guidelines for Management of Ip Address Space. RFC 1466, May (1993)
Lin, D., Zhang, Y., Hu, C., Liu, B., Zhang, X., Pao, D.: Route table partitioning and load balancing for parallel searching with TCAMs. In: IEEE International Parallel and Distributed Processing Symposium, Long Beach, CA, USA, pp. 1–10, March 2007
Chen, W., Xu, M., Yang, Y., Han, D.: Decomposed storage model of FIB for cluster router. Chin. J. Comput. 34(9), 1611–1620 (2011)
Tzeng, N.-F.: Routing table partitioning for speedy packet lookups in high-performance distributed routers. IEEE Trans. Parallel Distrib. Syst. 17(5), 481–494 (2006)
Li, Q., Wang, D., Xu, M., Yang, J.: On the scalability of router forwarding tables: Nexthop-selectable FIB aggregation. In: IEEE INFOCOM, Shanghai, China, vol. 42(4), pp. 321–325 (2011)
Zhang, X., Perrig, A., Zhang, H.: Centaur: A hybrid approach for reliable policy-based routing. In: IEEE 33rd International Conference on Distributed Computing Systems, Montreal, Quebec, Canada, pp. 76–84, June 2009
BGP Routing Table. http://www.cidr-report.org/as2.0/
Yang, T., Duan, R., Lu, J., Zhang, S., Dai, H., Liu, B.: CLUE: Achieving fast update over compressed table for parallel lookup with reduced dynamic redundancy. In: IEEE 32nd International Conference Distributed Computing Systems. Macau, China, pp. 678–687, June 2012
Li, Q., Xu, M., Chen, M.: NSFIB construction & aggregation with next hop of strict partial order. In: IEEE INFOCOM, Turin, Italy, pp. 550–554, April 2013
Chen, W., Liu, Y., Wang, H.: On storage partitioning of internet routing tables: A P2P-based enhancement for scalable routers. Peer-to-Peer Netw. Appl. 8(6), 952–964 (2015)
Acknowledgment
This work is supported by the National Natural Science Foundation of China under Grant No. 61373161, 61502320, 61300171. Science & Technology Project of Beijing Municipal Commission of Education under Grant No. KM201410028015, the Youth Backbone of Beijing Outstanding Talent Training Project under Grant No. 2014000020124G133, and Guangdong Natural Science Foundation No. 2015A030310492.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Chen, W., Lan, L., Tang, X., Zhang, S., Hu, G. (2017). Real-Time Dynamic Decomposition Storage of Routing Tables. In: Wang, S., Zhou, A. (eds) Collaborate Computing: Networking, Applications and Worksharing. CollaborateCom 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 201. Springer, Cham. https://doi.org/10.1007/978-3-319-59288-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-59288-6_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59287-9
Online ISBN: 978-3-319-59288-6
eBook Packages: Computer ScienceComputer Science (R0)