International journal of advanced smart convergence

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

Review On Tries for IPv6 Lookups

  • Bal, Rohit G (Department of Computer Science, Nepal Engineering College)
  • Received : 2016.08.08
  • Accepted : 2016.09.02
  • Published : 2016.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

Router main task is to provide routing of Internet Protocol (IP) packets. Routing is achieved with help of the IP lookup. Router stores information about the networks and interfaces in data structures commonly called as routing tables. Comparison of IP from incoming packet with the IPs stored in routing table for the information about route is IP Lookup. IP lookup performs by longest IP prefix matching. The performance of the IP router is based on the speed of prefix matching. IP lookup is a major bottle neck in the performance of Router. Various algorithms and data structures are available for IP lookup. This paper is about reviewing various tree based structure and its performance evaluation.

Keywords

References

  1. Postal J. Internet Protocol Darpa Internet Program Protocol Specification (IPv4), Sep 1981 [Online].Available: https://tools.ietf.org/html/rfc791
  2. Sklower K. A tree-based packet routing table for Berkeley unix. In USENIX Winter 1991 Jan 21 (Vol. 1991, pp. 93-99)
  3. Gray M, Internet Groth Summary.[Online].Available:http://www.mit.edu/people/mkgray/net/internet-growth-summary.html
  4. Deering. S, Hinden. R. Internet Protocol, Version 6 (IPv6) Specification, Dec 1998 [Online]. Available: https://tools.ietf.org/html/rfc2460
  5. Kijkanjanarat T, Chao HJ. Fast IP lookups using a two-trie data structure. InGlobal Telecommunications Conference, 1999. GLOBECOM'99 1999 (Vol. 2, pp. 1570-1575). IEEE.
  6. Ruiz-Sanchez MA, Biersack EW, Dabbous W. Survey and taxonomy of IP address lookup algorithms. Network, IEEE. 2001 Mar;15(2):8-23.
  7. Gupta P, McKeown N. Algorithms for packet classification. Network, iEEE. 2001 Mar;15(2):24-32.
  8. Coffman KG, Odlyzko AM. Internet growth: Is there a "Moore's Law" for data traffic?. InHandbook of massive data sets 2002 (pp. 47-93). Springer US.
  9. Sahni S, Kim KS. Efficient construction of variable-stride multibit tries for IP lookup. InApplications and the Internet, 2002.(SAINT 2002). Proceedings. 2002 Symposium on 2002 (pp. 220-227). IEEE.
  10. Baker F, Savola P. Ingress filtering for multihomed networks. BCP 84, RFC 3704, March; 2004 Mar 1
  11. Hagen S. IPv6 essentials. " O'Reilly Media, Inc."; 2006 May 17.
  12. Fu J, Hagsand O, Karlsson G. Improving and analyzing LC-Trie performance for IP-address lookup. Journal of Networks. 2007 Jan 6;2(3):18-27.
  13. Rojas-Cessa R, Kijkanjanarat T, Wangchai W, Patil K, Thirapittayatakul N. Helix: IP lookup scheme based on helicoidal properties of binary trees. Computer Networks. 2015 Oct 4;89:78-89. https://doi.org/10.1016/j.comnet.2015.07.012