New Data Structures for IP Lookup and Conflict Detection

DOI10.1007/978-3-642-02094-0_15MaRDI QIDQ3637325zbMATH OpenOpenAlexFDO

Authors Christine Maindorfer, Tobias Lauer, Thomas Ottmann

Publication date 9 July 2009

Published in Algorithmics of Large and Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02094-0_15

Mathematics Subject Classification ID

Internet topics (68M11) Data structures (68P05)

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 simple implementation technique for priority search queues
• Adaptive data structures for IP lookups
• scientific article; zbMATH DE number 1998344 (Why is no real title available?)
• Making data structures persistent
• Multiway range trees: scalable IP lookup with fast updates
• Priority Search Trees
• Recursively Partitioned Static IP Router Tables
• UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
• Versioning Tree Structures by Path-Merging

Cited in

(3)

• Multiway range trees: scalable IP lookup with fast updates
• UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
• UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES

This page was built for publication: New Data Structures for IP Lookup and Conflict Detection

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