Loading [a11y]/accessibility-menu.js
(log n) dynamic router-tables for ranges | IEEE Conference Publication | IEEE Xplore

(log n) dynamic router-tables for ranges


Abstract:

We consider router tables comprised of n pairs of tuples of the form (r,a), where r is a range of destination addresses matched by the tuple. The set of ranges in the tab...Show More

Abstract:

We consider router tables comprised of n pairs of tuples of the form (r,a), where r is a range of destination addresses matched by the tuple. The set of ranges in the table is conflict free. We develop a data structure, which employs priority-search trees as well as red-black trees, to represent the router table. This data structure permits us to perform each of the operations insert, delete, and find the tuple with most-specific matching-range for a given destination address in O(log n) each time. The insert and delete operations preserve the conflict-free property of the set of tuples. Our data structure represents the first O(log n) data structure for dynamic router tables with ranges. Experimental results are also presented.
Date of Conference: 03-03 July 2003
Date Added to IEEE Xplore: 23 September 2003
Print ISBN:0-7695-1961-X
Print ISSN: 1530-1346
Conference Location: Kemer-Antalya, Turkey

Contact IEEE to Subscribe

References

References is not available for this document.