Fast IP lookups using a two-trie data structure

T. Kijkanjanarat, H. Jonathan Chao

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

Abstract

IP routing table lookup has been considered as a major bottleneck for high performance routers. In this paper, we propose a new way to do IP route lookups based on a so-called two trie structure. The two-trie structure shares the nodes representing the front and the rear parts of the prefixes. This results in reducing the number of nodes in the structure. Our results indicate that the memory can be saved around 27% over the standard trie while it still provides the fast lookup (around 1.6 memory accesses in the average case and 8 memory accesses in the worst case). Also, the structure is not based on any assumptions about the distribution of prefix lengths in routing tables. Thus, it can be applied to the larger addresses of IPv6 without affecting the main structure.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
PublisherIEEE
Pages1570-1575
Number of pages6
Volume2
StatePublished - 1999
Event1999 IEEE Global Telecommunication Conference - GLOBECOM'99 - Rio de Janeiro, Braz
Duration: Dec 5 1999Dec 9 1999

Other

Other1999 IEEE Global Telecommunication Conference - GLOBECOM'99
CityRio de Janeiro, Braz
Period12/5/9912/9/99

Fingerprint

Data structures
routing
Data storage equipment
Table lookup
Routers
distribution

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Kijkanjanarat, T., & Chao, H. J. (1999). Fast IP lookups using a two-trie data structure. In Conference Record / IEEE Global Telecommunications Conference (Vol. 2, pp. 1570-1575). IEEE.

Fast IP lookups using a two-trie data structure. / Kijkanjanarat, T.; Chao, H. Jonathan.

Conference Record / IEEE Global Telecommunications Conference. Vol. 2 IEEE, 1999. p. 1570-1575.

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

Kijkanjanarat, T & Chao, HJ 1999, Fast IP lookups using a two-trie data structure. in Conference Record / IEEE Global Telecommunications Conference. vol. 2, IEEE, pp. 1570-1575, 1999 IEEE Global Telecommunication Conference - GLOBECOM'99, Rio de Janeiro, Braz, 12/5/99.
Kijkanjanarat T, Chao HJ. Fast IP lookups using a two-trie data structure. In Conference Record / IEEE Global Telecommunications Conference. Vol. 2. IEEE. 1999. p. 1570-1575
Kijkanjanarat, T. ; Chao, H. Jonathan. / Fast IP lookups using a two-trie data structure. Conference Record / IEEE Global Telecommunications Conference. Vol. 2 IEEE, 1999. pp. 1570-1575
@inproceedings{155088408f164b9d8c475c70edb316ba,
title = "Fast IP lookups using a two-trie data structure",
abstract = "IP routing table lookup has been considered as a major bottleneck for high performance routers. In this paper, we propose a new way to do IP route lookups based on a so-called two trie structure. The two-trie structure shares the nodes representing the front and the rear parts of the prefixes. This results in reducing the number of nodes in the structure. Our results indicate that the memory can be saved around 27{\%} over the standard trie while it still provides the fast lookup (around 1.6 memory accesses in the average case and 8 memory accesses in the worst case). Also, the structure is not based on any assumptions about the distribution of prefix lengths in routing tables. Thus, it can be applied to the larger addresses of IPv6 without affecting the main structure.",
author = "T. Kijkanjanarat and Chao, {H. Jonathan}",
year = "1999",
language = "English (US)",
volume = "2",
pages = "1570--1575",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Fast IP lookups using a two-trie data structure

AU - Kijkanjanarat, T.

AU - Chao, H. Jonathan

PY - 1999

Y1 - 1999

N2 - IP routing table lookup has been considered as a major bottleneck for high performance routers. In this paper, we propose a new way to do IP route lookups based on a so-called two trie structure. The two-trie structure shares the nodes representing the front and the rear parts of the prefixes. This results in reducing the number of nodes in the structure. Our results indicate that the memory can be saved around 27% over the standard trie while it still provides the fast lookup (around 1.6 memory accesses in the average case and 8 memory accesses in the worst case). Also, the structure is not based on any assumptions about the distribution of prefix lengths in routing tables. Thus, it can be applied to the larger addresses of IPv6 without affecting the main structure.

AB - IP routing table lookup has been considered as a major bottleneck for high performance routers. In this paper, we propose a new way to do IP route lookups based on a so-called two trie structure. The two-trie structure shares the nodes representing the front and the rear parts of the prefixes. This results in reducing the number of nodes in the structure. Our results indicate that the memory can be saved around 27% over the standard trie while it still provides the fast lookup (around 1.6 memory accesses in the average case and 8 memory accesses in the worst case). Also, the structure is not based on any assumptions about the distribution of prefix lengths in routing tables. Thus, it can be applied to the larger addresses of IPv6 without affecting the main structure.

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

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

M3 - Conference contribution

VL - 2

SP - 1570

EP - 1575

BT - Conference Record / IEEE Global Telecommunications Conference

PB - IEEE

ER -