The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2012 vol.61)
pp: 726-731
Sun-Yuan Hsieh , National Cheng Kung University, Tainan
Ying-Chi Yang , National Cheng Kung University, Tainan
ABSTRACT
In this paper, a new data structure, called the classified multisuffix trie (CMST), is proposed for designing dynamic router-tables. CMST achieves a better performance than existing data structures because each node can store more than one prefix and the longest matching prefix may be found in an internal node rather than on a leaf. Furthermore, with the classification in each node, the dynamic router-table operations can be performed efficiently. To reduce the memory requirement, we store each prefix's corresponding suffix in a CMST node, instead of storing a full binary string. Based on the CMST, we also propose another data structure, called the Partitioning Classified Multisuffix Trie (PCMST) to reduce the height of the trie and expedite router-table operations. Experiments using real IPv4 routing databases demonstrate that the proposed data structures are efficient in terms of memory usage and it performs well in terms of the average times of the lookup, insert, and delete operations. We report the results of experiments conducted to compare the performance of the proposed data structure with that of other structures using the benchmark IPv4 prefix databases AS4637, AS6447, and AS65000 with 219,581, 296,552, and 226,847 prefixes, respectively.
INDEX TERMS
Classless inter domain routing, dynamic router tables, IP address lookup, longest matching prefix, multiprefix trie, classified multisuffix trie.
CITATION
Sun-Yuan Hsieh, Ying-Chi Yang, "A Classified Multisuffix Trie for IP Lookup and Update", IEEE Transactions on Computers, vol.61, no. 5, pp. 726-731, May 2012, doi:10.1109/TC.2011.86
REFERENCES
[1] BGP Table obtained from http:/bgp.potaroo.net/, 2011.
[2] M. Berger, “IP Lookup with Low Memory Requirement and Fast Update,” Proc. Workshop High Performance Switching and Routing, pp. 287-291, June 2003.
[3] Y.K. Chang, Y.C. Lin, and C.C. Su, “Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine,” IEEE Trans. Computers, vol. 59, no. 4, pp. 492-506, Apr. 2010.
[4] Y.K. Chang and Y.C. Lin, “Dynamic Segment Trees for Ranges and Prefixes,” IEEE Trans. Computers, vol. 56, no. 6, pp. 769-784, June 2007.
[5] Y.K. Chang, “Simple and Fast IP Lookups Using Binomial Spanning Trees,” Computer Comm., vol. 28, no. 5, pp. 529-539, Mar. 2005.
[6] S. Deering and R. Hinden, “Internet Protocol Version 6 (IPv6) Specification,” RFC 1883, Dec. 1995.
[7] M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, “Small Forwarding Tables for Fast Routing Lookups,” Proc. ACM SIGCOMM Conf., pp. 3-14, 1997.
[8] W. Eatherton, G. Varghese, and Z. Dittia, “Tree Bitmap: Hardware/Software IP Lookup with Incremental Updates,” ACM SIGCOMM Computer Comm. Rev., vol. 34, no. 2, pp. 97-122, Apr. 2004.
[9] V. Fuller, T. Li, J. Yu, and K. Varadhan, “Classless Inter-Domain Routing (CIDR): An Address Assignment and Aggregation Strategy,” RFC 1519, Sept. 1993.
[10] S.-Y. Hsieh, Y.-L. Huang, Y.-C. Yang, “Multi-Prefix Trie: A New Data Structure for Designing Dynamic Router-Tables,” IEEE Trans. Computers, vol. 60, no. 5, pp. 693-706, May 2011.
[11] B. Lampson, V. Srinivasan, and G. Varghese, “IP Lookups Using Multiway and Multicolumn Search,” IEEE/ACM Trans. Networking, vol. 7, no. 3, pp. 324-334, June 1999.
[12] H. Lu, K.S. Kim, and S. Sahni, “Prefix and Interval-Partitioned Dynamic IP Router-Tables,” IEEE Trans. Computers, vol. 54, no. 5, pp. 545-557, May 2005.
[13] H. Lu and S. Sahni, “A B-tree Dynamic Router-Table Design,” IEEE Trans. Computers, vol. 54, no. 7, pp. 813-824, July 2005.
[14] H. Lu and S. Sahni, “Enhanced Interval Trees for Dynamic IP Router-Tables,” IEEE Trans. Computers, vol. 53, no. 12, pp. 1615-1628, Dec. 2004.
[15] S. Nilsson and G. Karlsson, “IP-Address Lookup Using LC-Trie,” IEEE J. Selected Areas in Comm., vol. 17, no. 6, pp. 1083-1092, June 1999.
[16] J. Postel, “Internet Protocol Darpa Internet Program Protocol Specification,” RFC791, Sept. 1981.
[17] V.C. Ravikumar, R. Mahapatra, and J.C. Liu, “Modified LC-Trie Based Efficient Routing Lookup,” Proc. IEEE 10th Int'l Symp. Modeling, Analysis, and Simulation of Computer and Telecomm. Systems (MASCOTS), pp. 177-182, Oct. 2002.
[18] S. Sahni and K.S. Kim, “An $O(\log n)$ Dynamic Router-table Design,” IEEE Trans. Computers, vol. 53, no. 3, pp. 351-363, Mar. 2004.
[19] S. Sahni and K.S. Kim, “Efficient Construction of Multibit Tries for IP Lookup,” IEEE/ACM Trans. Networking, vol. 11, no. 4, pp. 650-662, Aug. 2003.
[20] S. Sahni and H. Lu, “Dynamic Tree Bitmap for IP Lookup and Update,” Proc. Sixth Int'l Conf. Networking, pp. 79-84, 2007.
[21] K. Sklower, “A Tree-Based Packet Routing Table for Berkeley Unix,” Proc. Winter Usenix Conf., pp. 93-99, 1991.
[22] V. Srinivasan and G. varghese, “Fast Address Lookups Using Controlled Prefix Expansion,” ACM Trans. Computer Systems, vol. 17, no. 1, pp. 1-40, 1999.
[23] P.R. Warkhede, S. Suri, and G. Varghese, “Multiway Range Tree: Scalable IP Lookup with Fast Updates,” Computer Network, vol. 44, no. 3, pp. 289-303, Feb. 2004.
[24] L.C. Wuu, T.J. Liu, and K.M. Chen, “A Longest Prefix First Search Tree for IP Lookup,” Computer Network, vol. 51, no. 12, pp. 3354-3367, Aug. 2007.
36 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool