UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES

DOI10.1142/S0129054107004693MaRDI QIDQ5899166zbMATH OpenOpenAlexFDO

Authors Tobias Lauer, Thomas Ottmann, Amitava Datta

Publication date 25 April 2007

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

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

zbMATH Keywords

priority search treeIP router tablemin-augmented range treepriority search pennant

Mathematics Subject Classification ID

Data structures (68P05) Network design and communication in computer systems (68M10)

Recommendations

• UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
• New Data Structures for IP Lookup and Conflict Detection
• Multiway range trees: scalable IP lookup with fast updates
• EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS
• Efficient IP table lookup via adaptive stratified trees with selective reconstructions

Cites work

• scientific article; zbMATH DE number 2173815 (Why is no real title available?)
• Balancing binary trees by internal path reduction
• Priority Search Trees
• relaxed balance for search trees with local rebalancing

Cited in

(4)

• New Data Structures for IP Lookup and Conflict Detection
• Recursively Partitioned Static IP Router Tables
• UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
• EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS

This page was built for publication: UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES

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