IEIE Transactions on Smart Processing and Computing

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지
DOI QR코드

DOI QR Code

Multi-Stride Decision Trie for IP Address Lookup

  • Lee, Jungwon (Department of Electronic and Electrical Engineering, Ewha Womans University) ;
  • Lim, Hyesook (Department of Electronic and Electrical Engineering, Ewha Womans University)
  • Received : 2016.09.23
  • Accepted : 2016.10.18
  • Published : 2016.10.30
Download PDF
⟨ Previous Next ⟩

Abstract

Multi-bit tries have been proposed to improve the search performance of a binary trie by providing flexibility in stride values, which identify the number of bits examined at a time. However, constructing a variable-stride multi-bit trie is challenging since it is not easy to determine a proper stride value that satisfies the required performance at each node. The aim of this paper is to identify several desired characteristics of a trie for IP address lookup problems, and to propose a multi-stride decision trie that has these characteristics. Simulation results using actual routing sets with about 30,000 to 220,000 prefixes show that the proposed multi-stride decision trie has the desired characteristics and achieves IP address lookup using 33% to 47% of the 2-bit trie in the average number of node accesses, while requiring a smaller amount of memory.

Keywords

References

  1. H. Lim and N. Lee, "Survey and Proposal on Binary Search Algorithms for Longest Prefix Match," IEEE Communications Surveys and Tutorials, vol. 14, no. 3, pp.681-697, July 2012.
  2. J. Mun, and H. Lim, "New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms," " IEEE Trans. on Computers, vol. 65, no.5, pp.1558-1565, May 2016 https://doi.org/10.1109/TC.2015.2444850
  3. J. Mun, and H. Lim, "On Reducing False Positives of a Bloom Filter in Trie-Based Algorithms," IEIE Transactions on Smart Processing & computing, vol. 4, no. 3, pp.163-168 https://doi.org/10.5573/IEIESPC.2015.4.3.163
  4. J. Lee, and H. Lim,"Binary Search on Trie Levels with a Bloom Filter for Longest Prefix Match," IEEE HPSR, Jul. 2014, pp. 38-43.
  5. M. Kwon, P. Reviriego; S. Pontarelli "A lengthaware cuckoo filter for faster IP lookup," 2016 IEEE Conference on Computer Communications Workshops, 2016
  6. H. Lim, K. Lim, N. Lee, and K. Park, "On Adding Bloom Filters to Longest Prefix Matching Algorithms," IEEE Trans. on Computers, vol. 63, no. 2, pp.411- 423, Feb. 2014. https://doi.org/10.1109/TC.2012.193
  7. K. Kim and S. Sahni, "Efficient Construction of Pipelined Multibit-Trie Router-Tables," IEEE Trans. on Computers, vol. 56, no. 1, pp.32-43, Jan. 2007. https://doi.org/10.1109/TC.2007.250621
  8. C. Lin, C. Hsu, and S. Hsieh, "A Multi-index Hybrid Trie for IP Lookup and Updates," IEEE Trans. On Parallel and Distributed Systems, 2014.
  9. D. E. Taylor, J. S. Turner, J. W. Lockwood, T. S. Sproull, D. B. Parlour, "Scalable IP Lookup for Internet Routers," IEEE Journal on Selected Areas in Communications, vol. 21, no. 4, pp.522-534, 2003. https://doi.org/10.1109/JSAC.2003.810507
  10. O. Erdem and C. F. Bazlamacci, "Array Design for Trie-based IP Lookup," IEEE Communications Letters, vol.14, no.8, pp.773-775, 2010. https://doi.org/10.1109/LCOMM.2010.08.100398
  11. Q. Sun, Z. Li, and Y. Ma, "Overlapping Hash Trie: A Longest Prefix First Search Scheme for IPv4/IPv6 Lookup," ICCT, pp.1-4, 2006.
  12. L. Wuu, K. Chen, T. Liu, "A Longest Prefix First Search Tree for IP Lookup," ICC, pp. 989-993, 2005.
  13. P. Gupta and N. McKeown, "Classifying packets with hierarchical intelligent cuttings," IEEE Micro, vol. 20, no. 1, pp.34-41, Jan./Feb. 2000. https://doi.org/10.1109/40.820051
  14. H. Lim, C. Yim, and Earl E. Swartzlander, Jr., "Priority Tries for IP Address Lookup," IEEE Trans. on Computers, vol. 59, no. 6, pp. 784- 794, Jun. 2010. https://doi.org/10.1109/TC.2010.38