EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS

DOI10.1142/S0129054104002625MaRDI QIDQ3022022zbMATH OpenFDO

Authors Kun Suk Kim, Sartaj Sahni

Publication date 22 June 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054104002625

zbMATH Keywords

biased skip listsbursty accessdynamic router-tableslongest matching prefixpacket routingred-black treessplay trees

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
• UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
• Multiway range trees: scalable IP lookup with fast updates
• Efficient IP table lookup via adaptive stratified trees with selective reconstructions
• Algorithms – ESA 2004

Cites work

• A new weight balanced binary search tree
• The Propagation of Energy by Waves and the Amplitude of A Light Wave

Cited in

(2)

• UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
• UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES

This page was built for publication: EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3022022)