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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Maindorfer, C., Lauer, T., & Ottmann, T. (2009). New data structures for IP lookup and conflict detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5515 LNCS, pp. 319–329). https://doi.org/10.1007/978-3-642-02094-0_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
