UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES

DOI10.1142/S0129054107004693zbMath1112.68036OpenAlexW4242990453MaRDI QIDQ5899166

Amitava Datta, Thomas Ottmann, Tobias Lauer

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

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

Cites Work

• Unnamed Item
• Priority Search Trees
• Balancing binary trees by internal path reduction
• relaxed balance for search trees with local rebalancing

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