A method of processing inbound IP packets with a routing table

Tatuya Jinmei, Atsushi Onoe, Kazuhiko Yamamoto, Jun Ichiro Itojun Hagino, Hiroshi Esaki, Jun Murai

Research output: Contribution to journalArticle

Abstract

As the Internet continues to spread and equipment performance improves, the typical operation has been to assign multiple Internet Protocol (IP) addresses to one node. At this type of node, whether the node is the destination of the received packet must be efficiently determined. Conventionally, a Berkeley Software Distribution (BSD) system used an algorithm that performs a linear search for the address of the node. As described in this paper, the Widely Integrated Distributed Environment (WIDE) Project conducted R&D on an improved method using a routing table algorithm. Later an original improvement using a hash table was introduced into Internet Protocol Version 4 (IPv4) implementation in NetBSD and BSD/OS. In this paper, we explain these three methods and evaluate their performances using actual equipment. From the evaluation results, a decision method based on the routing table or the hash table is clearly an improvement over the conventional technique based on a linear search. In addition, the performance of the decision method using the routing table algorithm does not degrade even if the number of addresses increases similar to a conventional routing lookup.

Original languageEnglish
Pages (from-to)1-8
Number of pages8
JournalElectronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)
Volume86
Issue number9
DOIs
Publication statusPublished - 2003 Sep

Fingerprint

Internet protocols
Processing
Internet

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

A method of processing inbound IP packets with a routing table. / Jinmei, Tatuya; Onoe, Atsushi; Yamamoto, Kazuhiko; Hagino, Jun Ichiro Itojun; Esaki, Hiroshi; Murai, Jun.

In: Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi), Vol. 86, No. 9, 09.2003, p. 1-8.

Research output: Contribution to journalArticle

Jinmei, Tatuya ; Onoe, Atsushi ; Yamamoto, Kazuhiko ; Hagino, Jun Ichiro Itojun ; Esaki, Hiroshi ; Murai, Jun. / A method of processing inbound IP packets with a routing table. In: Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi). 2003 ; Vol. 86, No. 9. pp. 1-8.
@article{207fd03508e94090ab8da6a3b322e1db,
title = "A method of processing inbound IP packets with a routing table",
abstract = "As the Internet continues to spread and equipment performance improves, the typical operation has been to assign multiple Internet Protocol (IP) addresses to one node. At this type of node, whether the node is the destination of the received packet must be efficiently determined. Conventionally, a Berkeley Software Distribution (BSD) system used an algorithm that performs a linear search for the address of the node. As described in this paper, the Widely Integrated Distributed Environment (WIDE) Project conducted R&D on an improved method using a routing table algorithm. Later an original improvement using a hash table was introduced into Internet Protocol Version 4 (IPv4) implementation in NetBSD and BSD/OS. In this paper, we explain these three methods and evaluate their performances using actual equipment. From the evaluation results, a decision method based on the routing table or the hash table is clearly an improvement over the conventional technique based on a linear search. In addition, the performance of the decision method using the routing table algorithm does not degrade even if the number of addresses increases similar to a conventional routing lookup.",
author = "Tatuya Jinmei and Atsushi Onoe and Kazuhiko Yamamoto and Hagino, {Jun Ichiro Itojun} and Hiroshi Esaki and Jun Murai",
year = "2003",
month = "9",
doi = "10.1002/ecja.10110",
language = "English",
volume = "86",
pages = "1--8",
journal = "Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)",
issn = "8756-6621",
publisher = "John Wiley and Sons Inc.",
number = "9",

}

TY - JOUR

T1 - A method of processing inbound IP packets with a routing table

AU - Jinmei, Tatuya

AU - Onoe, Atsushi

AU - Yamamoto, Kazuhiko

AU - Hagino, Jun Ichiro Itojun

AU - Esaki, Hiroshi

AU - Murai, Jun

PY - 2003/9

Y1 - 2003/9

N2 - As the Internet continues to spread and equipment performance improves, the typical operation has been to assign multiple Internet Protocol (IP) addresses to one node. At this type of node, whether the node is the destination of the received packet must be efficiently determined. Conventionally, a Berkeley Software Distribution (BSD) system used an algorithm that performs a linear search for the address of the node. As described in this paper, the Widely Integrated Distributed Environment (WIDE) Project conducted R&D on an improved method using a routing table algorithm. Later an original improvement using a hash table was introduced into Internet Protocol Version 4 (IPv4) implementation in NetBSD and BSD/OS. In this paper, we explain these three methods and evaluate their performances using actual equipment. From the evaluation results, a decision method based on the routing table or the hash table is clearly an improvement over the conventional technique based on a linear search. In addition, the performance of the decision method using the routing table algorithm does not degrade even if the number of addresses increases similar to a conventional routing lookup.

AB - As the Internet continues to spread and equipment performance improves, the typical operation has been to assign multiple Internet Protocol (IP) addresses to one node. At this type of node, whether the node is the destination of the received packet must be efficiently determined. Conventionally, a Berkeley Software Distribution (BSD) system used an algorithm that performs a linear search for the address of the node. As described in this paper, the Widely Integrated Distributed Environment (WIDE) Project conducted R&D on an improved method using a routing table algorithm. Later an original improvement using a hash table was introduced into Internet Protocol Version 4 (IPv4) implementation in NetBSD and BSD/OS. In this paper, we explain these three methods and evaluate their performances using actual equipment. From the evaluation results, a decision method based on the routing table or the hash table is clearly an improvement over the conventional technique based on a linear search. In addition, the performance of the decision method using the routing table algorithm does not degrade even if the number of addresses increases similar to a conventional routing lookup.

UR - http://www.scopus.com/inward/record.url?scp=0038664293&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038664293&partnerID=8YFLogxK

U2 - 10.1002/ecja.10110

DO - 10.1002/ecja.10110

M3 - Article

AN - SCOPUS:0038664293

VL - 86

SP - 1

EP - 8

JO - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

JF - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

SN - 8756-6621

IS - 9

ER -