Coded and Scalar Prefix Trees: Prefix Matching Using the Novel Idea of Double Relation Chains |
Behdadfar, Mohammad
(Electrical and Computer Engineering, Isfahan University of Technology, Broadcast Engineering Department, IRIB University)
Saidi, Hossein (Electrical and Computer Engineering, Isfahan University of Technology) Hashemi, Massoud Reza (Electrical and Computer Engineering, Isfahan University of Technology) Lin, Ying-Dar (Department of Computer Science, National Chiao Tung University) |
1 | P.R. Warkhede, S. Suri, and G. Varghese, "Multiway Range Trees: Scalable IP Lookup with Fast Updates," Computer Netw., vol. 44, no. 3, 2004, pp. 289-303. DOI ScienceOn |
2 | H. Lu and S. Sahni, "A B-Tree Dynamic Router-Table Design," IEEE Trans. Computers, vol. 54, no. 7, 2005, pp. 813-824. DOI ScienceOn |
3 | Q. Sun et al., "A Scalable Exact Matching in Balance Tree Scheme for IPv6 Lookup," ACM SIGCOMM Data Communication Festival, IPv6, Aug. 2007. |
4 | N. Yazdani and P. Min, "Prefix Trees: New Efficient Data Structures for Matching Strings of Different Lengths," Proc. Int. Database Eng. Appl. Symp., July 2001, pp. 76-85. |
5 | M. Behdadfar and H. Saidi, "The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree," Proc. IFIP Networking, May, 2008, pp. 562-573. |
6 | T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, MIT Press, 1990. |
7 | D.R. Morrison, "PATRICIA Practical Algorithm to Retrieve Information Coded in Alphanumeric," J. ACM, vol. 15, no. 14, Oct. 1968, pp. 514-534. DOI |
8 | S. Nilson and G. Karlsson, "IP Address Lookup Using LC-Tries," IEEE JSAC, vol. 17, June 1999, pp. 1083-1092. |
9 | V. Srinivasan and G. Varghese, "Fast Address Lookups Using Controlled Prefix Expansion," ACM Trans. Computer Syst., vol. 17, no. 1, Feb. 1999, pp. 1-40. DOI ScienceOn |
10 | L.C. Wuu, K.M. Chen, and T.J. Liu, "A Longest Prefix First Search Tree for IP Lookup," Proc. ICC, May 2005, pp. 989-993. |
11 | P. Gupta, S. Lin, and N. McKeown, "Routing Lookups in Hardware at Memory Access Speeds," Proc. IEEE INFOCOM, 1998. |
12 | M. Behdadfar et al., "Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet." Proc. IEEE INFOCOM, Apr. 2009. |
13 | M. Behdadfar et al., "IP Lookup Using the Novel Idea of Scalar Prefix Search with Fast Table Updates," IEICE Trans. Inf. & Syst., vol. E93-D, no. 11, Nov. 2010, pp. 2932-2943. DOI ScienceOn |
14 | H. Lim, H. Kim, and C. Yim, "IP Address Lookup for Internet Routers Using Balanced Binary Search with Prefix Vector," IEEE Trans. Commun., vol. 57, no. 3, Mar. 2009, pp. 618-621. DOI |
15 | K.H. Rosen and J.G. Michaels, Handbook of Discrete and Combinatorial Mathematics, CRC Press, 2000. |
16 | http://bgp.potaroo.net |
17 | W. Eatherton, G. Varghese, and Z. Dittia, "Tree Bitmap: Hardware/Software IP Lookups with Incremental Updates," Proc. ACM SIGCOMM, 2004, pp. 97-122. |
18 | B. Lampson, V. Srinivasan, and G. Varghese, "IP Lookups Using Multiway and Multicolumn Search," IEEE/ACM Trans. Networking, vol. 7, no. 3, June. 1999, pp. 324-334. DOI ScienceOn |