Multiway range trees: scalable IP lookup with fast updates
From MaRDI portal
Recommendations
Cited in
(17)- Level compressed DAGs for lookup tables
- New Data Structures for IP Lookup and Conflict Detection
- Fast binary and multiway prefix searches for packet forwarding
- scientific article; zbMATH DE number 2011860 (Why is no real title available?)
- A longest prefix first search tree for IP lookup
- Efficient IP table lookup via adaptive stratified trees with selective reconstructions
- scientific article; zbMATH DE number 2030084 (Why is no real title available?)
- scientific article; zbMATH DE number 1998344 (Why is no real title available?)
- Experimental and Efficient Algorithms
- Algorithms – ESA 2004
- Adaptive data structures for IP lookups
- UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
- UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
- I/O efficient dynamic data structures for longest prefix queries
- Multilevel length-based classified index table for IP lookups and updates
- EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS
- XOR-based schemes for fast parallel IP lookups
This page was built for publication: Multiway range trees: scalable IP lookup with fast updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1888474)