New Data Structures for IP Lookup and Conflict Detection

DOI10.1007/978-3-642-02094-0_15zbMath1248.68171OpenAlexW1486033684MaRDI QIDQ3637325

Tobias Lauer, Christine Maindorfer, 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

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

Cites Work

• Unnamed Item
• Making data structures persistent
• Multiway range trees: scalable IP lookup with fast updates
• Versioning Tree Structures by Path-Merging
• Priority Search Trees
• A simple implementation technique for priority search queues
• Recursively Partitioned Static IP Router Tables
• Adaptive data structures for IP lookups
• UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES

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