Enabling incremental updates to LC-trie for efficient management of IP forwarding tables

Derek Pao; Yiu-Keung Li

doi:10.1109/LCOMM.2003.812174

Enabling incremental updates to LC-trie for efficient management of IP forwarding tables

Derek Pao
, Yiu-Keung Li

Department of Electrical Engineering

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

12 Citations (Scopus)

Abstract

Level-compressed trie (LC-trie) is an efficient data structure for fast IP address lookup. However, the data structure needs to be rebuilt every time the table is updated. Consequently, the LC-trie algorithm is not suitable for application in a dynamic environment where frequent updates to the forwarding table are necessary. In this letter, it is shown that with appropriate modifications to the data structure, incremental updates can be done efficiently.

Original language	English
Pages (from-to)	245-247
Journal	IEEE Communications Letters
Volume	7
Issue number	5
DOIs	https://doi.org/10.1109/LCOMM.2003.812174
Publication status	Published - May 2003

Research Keywords

Incremental route updates
IP address lookup
Level-compressed binary-trie

Access Output

10.1109/LCOMM.2003.812174

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{141f6c528f2a4664ab3342958bf68cc1,

title = "Enabling incremental updates to LC-trie for efficient management of IP forwarding tables",

abstract = "Level-compressed trie (LC-trie) is an efficient data structure for fast IP address lookup. However, the data structure needs to be rebuilt every time the table is updated. Consequently, the LC-trie algorithm is not suitable for application in a dynamic environment where frequent updates to the forwarding table are necessary. In this letter, it is shown that with appropriate modifications to the data structure, incremental updates can be done efficiently.",

keywords = "Incremental route updates, IP address lookup, Level-compressed binary-trie",

author = "Derek Pao and Yiu-Keung Li",

year = "2003",

month = may,

doi = "10.1109/LCOMM.2003.812174",

language = "English",

volume = "7",

pages = "245--247",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "IEEE",

number = "5",

}

TY - JOUR

T1 - Enabling incremental updates to LC-trie for efficient management of IP forwarding tables

AU - Pao, Derek

AU - Li, Yiu-Keung

PY - 2003/5

Y1 - 2003/5

N2 - Level-compressed trie (LC-trie) is an efficient data structure for fast IP address lookup. However, the data structure needs to be rebuilt every time the table is updated. Consequently, the LC-trie algorithm is not suitable for application in a dynamic environment where frequent updates to the forwarding table are necessary. In this letter, it is shown that with appropriate modifications to the data structure, incremental updates can be done efficiently.

AB - Level-compressed trie (LC-trie) is an efficient data structure for fast IP address lookup. However, the data structure needs to be rebuilt every time the table is updated. Consequently, the LC-trie algorithm is not suitable for application in a dynamic environment where frequent updates to the forwarding table are necessary. In this letter, it is shown that with appropriate modifications to the data structure, incremental updates can be done efficiently.

KW - Incremental route updates

KW - IP address lookup

KW - Level-compressed binary-trie

UR - https://www.scopus.com/pages/publications/0037942535

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0037942535&origin=recordpage

U2 - 10.1109/LCOMM.2003.812174

DO - 10.1109/LCOMM.2003.812174

M3 - RGC 21 - Publication in refereed journal

SN - 1089-7798

VL - 7

SP - 245

EP - 247

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 5

ER -

Enabling incremental updates to LC-trie for efficient management of IP forwarding tables

Abstract

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this