Real-Time Dynamic Decomposition Storage of Routing Tables
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.
KeywordsRouting tables Real-time Dynamic Decomposition storage Pocket prefix Mapping table
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.
- 1.BGP Routing Table Analysis Reports. http://bgp.potaroo.net
- 2.Carpenter, B., Crowcroft, J.: IPv4 Address Behaviour Today. RFC 2101, February 1997Google Scholar
- 3.Gerich, E.: Guidelines for Management of Ip Address Space. RFC 1466, May (1993)Google Scholar
- 4.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 2007Google Scholar
- 7.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)Google Scholar
- 8.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 2009Google Scholar
- 9.BGP Routing Table. http://www.cidr-report.org/as2.0/
- 10.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 2012Google Scholar
- 11.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 2013Google Scholar