The Community for Technology Leaders
RSS Icon
Issue No.01 - January (2008 vol.57)
pp: 110-125
Dynamic IP router table schemes, proposed in the literature, perform an IP lookup or an on-line prefix update in O(log n) memory accesses. In term of lookup time, they are still slower than FEC (CNHA/CWA) scheme, which requires exactly (at most) three memory accesses for each lookup, irrespective of the number of prefixes n. The prefix update in FEC (CNHA/CWA) has a drawback: Off-line solutions need structure reconstruction, or implementing on-line prefix updates is difficult. This paper solves this problem. We propose the use of lexicographic ordered prefixes to reduce off-line construction time. Simulations on several real routing databases, run on the same platform, show that our approach constructs FEC (CNHA/CWA) tables in 2.56 to 7.74 (1.56 to 2.7) times faster than that from previous techniques. Our on-line update scheme uses an updatable-address-set and selectively decompresses the FEC and CNHA/CWA structures to modify only the next-hops of the addresses in the set. Recompressing the updated structures, the resulting tables are identical to what would have been obtained by structure reconstructions, but at much lower computational cost. Our on-line update for FEC (CNHA/CWA) scheme takes at most 10.1 (7.21) -?s, which is of same order as achieved by the recently proposed schemes.
Routers, Internet, Algorithm/protocol design and analysis
Sieteng Soh, Lely Hiryanto, Suresh Rai, "Efficient Prefix Updates for IP Router Using Lexicographic Ordering and Updatable Address Set", IEEE Transactions on Computers, vol.57, no. 1, pp. 110-125, January 2008, doi:10.1109/TC.2007.70776
[1] R.C. Chang and B.-H. Lim, “Efficient IP Routing Table VLSI Design for Multigigabit Routers,” IEEE Trans. Circuits and Systems, vol. 51, no. 4, pp. 700-708, Apr. 2004.
[2] P. Crescenzi, L. Dardini, and R. Grossi, “IP Address Lookup Made Fast and Simple,” Proc. Seventh Ann. European Symp. Algorithms, Technical Report TR-99-01, Univ. of Pisa, 1999.
[3] M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, “Small Forwarding Tables for Fast Routing Lookups,” Proc. ACM SIGCOMM '97, pp. 3-14, 1997.
[4] L. Hiryanto, S. Soh, S. Rai, and R.P. Gopalan, “Fast IP Table Lookup Construction Using Lexicographic Prefix Ordering,” Proc. 11th IEEE Asia-Pacific Conf. Comm. (APCC '05), 2005.
[5] N.-F. Huang and S.-M. Zhao, “A Novel IP-Routing Lookup Scheme and Hardware Architecture for Multigigabit Switching Routers,” IEEE J. Selected Areas in Comm., vol. 17, no. 6, pp. 1093-1104, June 1999.
[6] C. Labovitz, G.R. Malan, and F. Jahanian, “Internet Routing Instability,” IEEE/ACM Trans. Networking, vol. 6, no. 5, pp. 515-528, 1998.
[7] 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, 1999.
[8] H. Lu and S. Sahni, “A B-Tree Dynamic Router-Table Design,” IEEE Trans. Computers, vol. 54, no. 7, pp. 813-824, July 2005.
[9] H. Lu and S. Sahni, “$O(\log n)$ Dynamic Router-Tables for Prefixes and Ranges,” IEEE Trans. Computers, vol. 53, no. 10, pp. 1217-1230, Oct. 2004.
[10] 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.
[11] 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.
[12] S. Nilsson and G. Karlsson, “Fast Address Lookup for Internet Routers,” IEEE J. Selected Areas in Comm., vol. 17, no. 6, pp. 1083-1092, June 1999.
[13] D. Pao and Y.-K. Lie, “Enabling Incremental Updates to LC-Trie for Efficient Management of IP Forwarding Tables,” IEEE Comm. Letters, vol. 7, pp. 245-247, May 2003.
[14] V.C. Ravikumar, R. Mahapatra, and J.C. Liu, “Modified LC-Trie Based Efficient Routing Lookup,” Proc. 10th IEEE Int'l Symp. Modeling, Analysis, and Simulation of Computer and Telecomm. Systems, pp. 1-6, 2002.
[15] M.A. Ruiz-Sanchez, E.W. Biersack, and W. Dabbous, “Survey and Taxonomy of IP Address Lookup Algorithms,” IEEE Network, vol. 15, pp. 8-23, Mar.-Apr. 2001.
[16] S. Sahni and K.S. Kim, “Efficient Construction of Variable-Stride Multibit Tries for IP Lookup,” Proc. IEEE Symp. Applications and the Internet, pp. 220-229, 2002.
[17] 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.
[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 Dynamic Lookup for Bursty Access Patterns,” Int'l J. Foundations of Computer Science, vol. 15, no. 4, pp. 567-591, 2004.
[20] S. Soh, L. Hiryanto, S. Rai, and R.P. Gopalan, “Dynamic Router Tables for Full Expansion/Compression IP Lookup,” Proc. IEEE Tencon '05, 2005.
[21] V. Srinivasan and G. Varghese, “Fast Address Lookups Using Controlled Prefix Expansion,” ACM Trans. Computer Systems, vol. 17, no. 1, pp. 1-40, 1999.
[22] X. Sun and Y.Q. Zhao, “An On-Chip IP Address Lookup Algorithm,” IEEE Trans. Computers, vol. 54, no. 7, pp. 873-885, July 2005.
[23] J. van Lunteren, “Searching Very Large Routing Tables in Fast SRAM,” Proc. Int'l Conf. Computational Nanoscience (ICCN '01), pp.4-11, 2001.
[24] P.C. Wang, C.T. Chan, and Y.C. Chen, “A Fast Table Update Scheme for High Performance IP Forwarding,” Proc. Eighth Int'l Conf. Parallel and Distributed Systems, pp. 592-597, 2001.
54 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool