A memory-efficient scheme for Address Lookup using Compact Prefix Tries

Anand Sarda, Arunabha Sen

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

Abstract

In this paper we present a new memory-efficient scheme for address lookup that exploits the caching support provided by general-purpose processors. We propose Compact Prefix Tries, in which prefixes occurring at multiple levels of a subtrie are compressed into a single node that fits in a single cache line. The scheme performs well in compressing dense as well as sparse tries. For an IP core router (Mae-West) database with 93354 prefixes, the simulation results for Compact Prefix Tries show up to 70% improvement in lookup performance and up to 33% reduction in memory when compared with LC-Tries. In fact, the entire forwarding table for Mae-West required only 829 KB space. Measurements for Compact Prefix Tries, when compared with most existing schemes, show better results in terms of memory usage as well as lookup speeds. Moreover, as the memory usage is significantly less and sparse tries with long paths can be compressed into only a few nodes, this scheme is particularly attractive for IPv6.

Original languageEnglish (US)
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Pages3943-3947
Number of pages5
Volume7
StatePublished - 2003
EventIEEE Global Telecommunications Conference GLOBECOM'03 - San Francisco, CA, United States
Duration: Dec 1 2003Dec 5 2003

Other

OtherIEEE Global Telecommunications Conference GLOBECOM'03
CountryUnited States
CitySan Francisco, CA
Period12/1/0312/5/03

Fingerprint

Data storage equipment
caching
Routers
simulation
Intellectual property core
speed

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Sarda, A., & Sen, A. (2003). A memory-efficient scheme for Address Lookup using Compact Prefix Tries. In GLOBECOM - IEEE Global Telecommunications Conference (Vol. 7, pp. 3943-3947)

A memory-efficient scheme for Address Lookup using Compact Prefix Tries. / Sarda, Anand; Sen, Arunabha.

GLOBECOM - IEEE Global Telecommunications Conference. Vol. 7 2003. p. 3943-3947.

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

Sarda, A & Sen, A 2003, A memory-efficient scheme for Address Lookup using Compact Prefix Tries. in GLOBECOM - IEEE Global Telecommunications Conference. vol. 7, pp. 3943-3947, IEEE Global Telecommunications Conference GLOBECOM'03, San Francisco, CA, United States, 12/1/03.
Sarda A, Sen A. A memory-efficient scheme for Address Lookup using Compact Prefix Tries. In GLOBECOM - IEEE Global Telecommunications Conference. Vol. 7. 2003. p. 3943-3947
Sarda, Anand ; Sen, Arunabha. / A memory-efficient scheme for Address Lookup using Compact Prefix Tries. GLOBECOM - IEEE Global Telecommunications Conference. Vol. 7 2003. pp. 3943-3947
@inproceedings{a8d8698af7b540659ffeaebb16d1d014,
title = "A memory-efficient scheme for Address Lookup using Compact Prefix Tries",
abstract = "In this paper we present a new memory-efficient scheme for address lookup that exploits the caching support provided by general-purpose processors. We propose Compact Prefix Tries, in which prefixes occurring at multiple levels of a subtrie are compressed into a single node that fits in a single cache line. The scheme performs well in compressing dense as well as sparse tries. For an IP core router (Mae-West) database with 93354 prefixes, the simulation results for Compact Prefix Tries show up to 70{\%} improvement in lookup performance and up to 33{\%} reduction in memory when compared with LC-Tries. In fact, the entire forwarding table for Mae-West required only 829 KB space. Measurements for Compact Prefix Tries, when compared with most existing schemes, show better results in terms of memory usage as well as lookup speeds. Moreover, as the memory usage is significantly less and sparse tries with long paths can be compressed into only a few nodes, this scheme is particularly attractive for IPv6.",
author = "Anand Sarda and Arunabha Sen",
year = "2003",
language = "English (US)",
volume = "7",
pages = "3943--3947",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - A memory-efficient scheme for Address Lookup using Compact Prefix Tries

AU - Sarda, Anand

AU - Sen, Arunabha

PY - 2003

Y1 - 2003

N2 - In this paper we present a new memory-efficient scheme for address lookup that exploits the caching support provided by general-purpose processors. We propose Compact Prefix Tries, in which prefixes occurring at multiple levels of a subtrie are compressed into a single node that fits in a single cache line. The scheme performs well in compressing dense as well as sparse tries. For an IP core router (Mae-West) database with 93354 prefixes, the simulation results for Compact Prefix Tries show up to 70% improvement in lookup performance and up to 33% reduction in memory when compared with LC-Tries. In fact, the entire forwarding table for Mae-West required only 829 KB space. Measurements for Compact Prefix Tries, when compared with most existing schemes, show better results in terms of memory usage as well as lookup speeds. Moreover, as the memory usage is significantly less and sparse tries with long paths can be compressed into only a few nodes, this scheme is particularly attractive for IPv6.

AB - In this paper we present a new memory-efficient scheme for address lookup that exploits the caching support provided by general-purpose processors. We propose Compact Prefix Tries, in which prefixes occurring at multiple levels of a subtrie are compressed into a single node that fits in a single cache line. The scheme performs well in compressing dense as well as sparse tries. For an IP core router (Mae-West) database with 93354 prefixes, the simulation results for Compact Prefix Tries show up to 70% improvement in lookup performance and up to 33% reduction in memory when compared with LC-Tries. In fact, the entire forwarding table for Mae-West required only 829 KB space. Measurements for Compact Prefix Tries, when compared with most existing schemes, show better results in terms of memory usage as well as lookup speeds. Moreover, as the memory usage is significantly less and sparse tries with long paths can be compressed into only a few nodes, this scheme is particularly attractive for IPv6.

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

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

M3 - Conference contribution

AN - SCOPUS:0842267574

VL - 7

SP - 3943

EP - 3947

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -