IP look-up with time or memory guarantee and low update time

G. T. Kousiouris, D. N. Serpanos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

IP look-up is one of the more important processes that take place during the transmission of an IP packet from its source to its destination. In every intermediate node a choice must be made as to which exit port the packet must be forwarded, after consulting the routing table. We propose two algorithms with different requirements. The ARPA algorithm emphasizes on memory management and update time for the routing table by using hashing and double linked lists, while the HYDRA algorithm achieves a steady, guaranteed performance in look-up time regardless of the size of the data structure by the use of an index structure, while greatly improving the update time of the expansion-compression algorithm.

Original languageEnglish
Title of host publicationProceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology
Pages159-163
Number of pages5
Volume2005
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
Event5th IEEE International Symposium on Signal Processing and Information Technology - Athens, Greece
Duration: 18 Dec 200521 Dec 2005

Other

Other5th IEEE International Symposium on Signal Processing and Information Technology
CountryGreece
CityAthens
Period18/12/0521/12/05

Fingerprint

Data storage equipment
Data structures

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kousiouris, G. T., & Serpanos, D. N. (2005). IP look-up with time or memory guarantee and low update time. In Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology (Vol. 2005, pp. 159-163). [1577088] https://doi.org/10.1109/ISSPIT.2005.1577088

IP look-up with time or memory guarantee and low update time. / Kousiouris, G. T.; Serpanos, D. N.

Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology. Vol. 2005 2005. p. 159-163 1577088.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kousiouris, GT & Serpanos, DN 2005, IP look-up with time or memory guarantee and low update time. in Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology. vol. 2005, 1577088, pp. 159-163, 5th IEEE International Symposium on Signal Processing and Information Technology, Athens, Greece, 18/12/05. https://doi.org/10.1109/ISSPIT.2005.1577088
Kousiouris GT, Serpanos DN. IP look-up with time or memory guarantee and low update time. In Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology. Vol. 2005. 2005. p. 159-163. 1577088 https://doi.org/10.1109/ISSPIT.2005.1577088
Kousiouris, G. T. ; Serpanos, D. N. / IP look-up with time or memory guarantee and low update time. Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology. Vol. 2005 2005. pp. 159-163
@inproceedings{5e681e43a28b4f37a995f5a72c2157c9,
title = "IP look-up with time or memory guarantee and low update time",
abstract = "IP look-up is one of the more important processes that take place during the transmission of an IP packet from its source to its destination. In every intermediate node a choice must be made as to which exit port the packet must be forwarded, after consulting the routing table. We propose two algorithms with different requirements. The ARPA algorithm emphasizes on memory management and update time for the routing table by using hashing and double linked lists, while the HYDRA algorithm achieves a steady, guaranteed performance in look-up time regardless of the size of the data structure by the use of an index structure, while greatly improving the update time of the expansion-compression algorithm.",
author = "Kousiouris, {G. T.} and Serpanos, {D. N.}",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/ISSPIT.2005.1577088",
language = "English",
volume = "2005",
pages = "159--163",
booktitle = "Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology",

}

TY - GEN

T1 - IP look-up with time or memory guarantee and low update time

AU - Kousiouris, G. T.

AU - Serpanos, D. N.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - IP look-up is one of the more important processes that take place during the transmission of an IP packet from its source to its destination. In every intermediate node a choice must be made as to which exit port the packet must be forwarded, after consulting the routing table. We propose two algorithms with different requirements. The ARPA algorithm emphasizes on memory management and update time for the routing table by using hashing and double linked lists, while the HYDRA algorithm achieves a steady, guaranteed performance in look-up time regardless of the size of the data structure by the use of an index structure, while greatly improving the update time of the expansion-compression algorithm.

AB - IP look-up is one of the more important processes that take place during the transmission of an IP packet from its source to its destination. In every intermediate node a choice must be made as to which exit port the packet must be forwarded, after consulting the routing table. We propose two algorithms with different requirements. The ARPA algorithm emphasizes on memory management and update time for the routing table by using hashing and double linked lists, while the HYDRA algorithm achieves a steady, guaranteed performance in look-up time regardless of the size of the data structure by the use of an index structure, while greatly improving the update time of the expansion-compression algorithm.

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

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

U2 - 10.1109/ISSPIT.2005.1577088

DO - 10.1109/ISSPIT.2005.1577088

M3 - Conference contribution

VL - 2005

SP - 159

EP - 163

BT - Proceedings of the Fifth IEEE International Symposium on Signal Processing and Information Technology

ER -