Name
Abstract | ||
|---|---|---|
In this paper we present a survey of new data structures for the representation of dynamic range router tables that employ most specific range matching. We present the min-augmented range tree with a relaxed balancing scheme, allowing updates and rebalancing tasks to be decoupled. Utilizing this scheme, IP lookups are not as much delayed as in a strict balancing scheme. Furthermore, we outline additional improvements to an existing online conflict detection approach, saving space and update costs. For offline conflict detection and resolution we describe an efficient sweepline algorithm. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02094-0_15 | Algorithmics of Large and Complex Networks |
Keywords | DocType | Volume |
efficient sweepline algorithm,strict balancing scheme,new data structures,additional improvement,min-augmented range tree,offline conflict detection,new data structure,conflict detection,dynamic range router table,existing online conflict detection,specific range matching,ip lookup,ip lookups,data structure,dynamic range | Conference | 5515 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
19 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christine Maindorfer | 1 | 3 | 1.45 |
| Tobias Lauer | 2 | 37 | 8.65 |
| Th. Ottmann | 3 | 468 | 124.40 |