On designing address lookup methods for IPv6

Research output: Chapter in Book/Report/Conference proceedingChapter or book articleProfessional

Abstract

Adoption of IP version 6 will solve the threat of running out of the IP address space. IPv6 increases the length of IP address from 32 bits, provided by IPv4, to 128 bits. Such address space should be more than adequate for all needs that can be imagined. Nevertheless, there are also worries concerning the impact of handling very long addresses to the performance of the IP routers. These worries have lead to efforts to prove the scalability of existing IPv4 address lookup algorithms and, if the scalability is lacking, efforts to modify them to better suit for 128 bit addresses. However, those efforts seems to be missing the whole point - the address structure in IPv6 differs completely from that of IPv4. Thus new ways to do the address lookup are needed. These new methods can utilise simple table lookup operations and thus they can easily exceed the speed of existing IPv4 address lookup algorithms.
Original languageEnglish
Title of host publicationRecent Advances in Communications and Computer Science
Pages254-259
Publication statusPublished - 2003
MoE publication typeNot Eligible

Fingerprint

Scalability
Table lookup
Routers

Keywords

  • address lookup
  • IP routers
  • IPv6

Cite this

Seppänen, K. (2003). On designing address lookup methods for IPv6. In Recent Advances in Communications and Computer Science (pp. 254-259)
Seppänen, Kari. / On designing address lookup methods for IPv6. Recent Advances in Communications and Computer Science. 2003. pp. 254-259
@inbook{c15907becd55453f8acdf57f61727144,
title = "On designing address lookup methods for IPv6",
abstract = "Adoption of IP version 6 will solve the threat of running out of the IP address space. IPv6 increases the length of IP address from 32 bits, provided by IPv4, to 128 bits. Such address space should be more than adequate for all needs that can be imagined. Nevertheless, there are also worries concerning the impact of handling very long addresses to the performance of the IP routers. These worries have lead to efforts to prove the scalability of existing IPv4 address lookup algorithms and, if the scalability is lacking, efforts to modify them to better suit for 128 bit addresses. However, those efforts seems to be missing the whole point - the address structure in IPv6 differs completely from that of IPv4. Thus new ways to do the address lookup are needed. These new methods can utilise simple table lookup operations and thus they can easily exceed the speed of existing IPv4 address lookup algorithms.",
keywords = "address lookup, IP routers, IPv6",
author = "Kari Sepp{\"a}nen",
year = "2003",
language = "English",
pages = "254--259",
booktitle = "Recent Advances in Communications and Computer Science",

}

Seppänen, K 2003, On designing address lookup methods for IPv6. in Recent Advances in Communications and Computer Science. pp. 254-259.

On designing address lookup methods for IPv6. / Seppänen, Kari.

Recent Advances in Communications and Computer Science. 2003. p. 254-259.

Research output: Chapter in Book/Report/Conference proceedingChapter or book articleProfessional

TY - CHAP

T1 - On designing address lookup methods for IPv6

AU - Seppänen, Kari

PY - 2003

Y1 - 2003

N2 - Adoption of IP version 6 will solve the threat of running out of the IP address space. IPv6 increases the length of IP address from 32 bits, provided by IPv4, to 128 bits. Such address space should be more than adequate for all needs that can be imagined. Nevertheless, there are also worries concerning the impact of handling very long addresses to the performance of the IP routers. These worries have lead to efforts to prove the scalability of existing IPv4 address lookup algorithms and, if the scalability is lacking, efforts to modify them to better suit for 128 bit addresses. However, those efforts seems to be missing the whole point - the address structure in IPv6 differs completely from that of IPv4. Thus new ways to do the address lookup are needed. These new methods can utilise simple table lookup operations and thus they can easily exceed the speed of existing IPv4 address lookup algorithms.

AB - Adoption of IP version 6 will solve the threat of running out of the IP address space. IPv6 increases the length of IP address from 32 bits, provided by IPv4, to 128 bits. Such address space should be more than adequate for all needs that can be imagined. Nevertheless, there are also worries concerning the impact of handling very long addresses to the performance of the IP routers. These worries have lead to efforts to prove the scalability of existing IPv4 address lookup algorithms and, if the scalability is lacking, efforts to modify them to better suit for 128 bit addresses. However, those efforts seems to be missing the whole point - the address structure in IPv6 differs completely from that of IPv4. Thus new ways to do the address lookup are needed. These new methods can utilise simple table lookup operations and thus they can easily exceed the speed of existing IPv4 address lookup algorithms.

KW - address lookup

KW - IP routers

KW - IPv6

UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4944221149&partnerID=MN8TOARS

M3 - Chapter or book article

SP - 254

EP - 259

BT - Recent Advances in Communications and Computer Science

ER -

Seppänen K. On designing address lookup methods for IPv6. In Recent Advances in Communications and Computer Science. 2003. p. 254-259