A Global IPv6 Unicast Address Lookup Scheme Using Variable Multiple Hashing 


Vol. 31,  No. 5, pp. 378-389, May  2006


PDF
  Abstract

An IP address lookup scheme has become a critical issue increasingly for high-speed networking techniques due to the advent of IPv6 based on 128bit. In this paper, a novel global IPv6 unicast address lookup scheme is proposed for next generation internet routers. The proposed scheme perform a variable multiple hashing based on prefix grouping. Accordingly, it should not only minimize overflows with the proper number of memory modules, but also reduce a memory size required to organize forwarding tables. It has the fast building and searching mechanisms for forwarding tables during only a single memory access. Besides, it is easy to update forwarding tables incrementally. In the simulation using CERNET routing data as a 6bone test phase, we compared the proposed scheme with a similar scheme using a uniform multiple hashing. As a result, we verified that the number of overflows is reduced by 50% and the size of memory for forwarding tables is shrunken by 15% with 8 tables.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Park, B. I. Moon, S. Kang, "A Global IPv6 Unicast Address Lookup Scheme Using Variable Multiple Hashing," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 5, pp. 378-389, 2006. DOI: .

[ACM Style]

Hyuntae Park, Byung In Moon, and Sungho Kang. 2006. A Global IPv6 Unicast Address Lookup Scheme Using Variable Multiple Hashing. The Journal of Korean Institute of Communications and Information Sciences, 31, 5, (2006), 378-389. DOI: .

[KICS Style]

Hyuntae Park, Byung In Moon, Sungho Kang, "A Global IPv6 Unicast Address Lookup Scheme Using Variable Multiple Hashing," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 5, pp. 378-389, 5. 2006.