O(log n ) Dynamic Packet Routing

Authors:
Sartaj Sahni;Kun Suk Kim
Affiliations:
-;-
Venue:
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Year:
2002

Citing 0
Cited 7

Dynamic rectangular intersection with priorities

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
O(\log n) Dynamic Router-Tables for Prefixes and Ranges

IEEE Transactions on Computers
Enhanced Interval Trees for Dynamic IP Router-Tables

IEEE Transactions on Computers
Prefix and Interval-Partitioned Dynamic IP Router-Tables

IEEE Transactions on Computers
A B-Tree Dynamic Router-Table Design

IEEE Transactions on Computers
I/O Efficient Dynamic Data Structures for Longest Prefix Queries

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A dynamic stabbing-max data structure with sub-logarithmic query time

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

A data structure that permits you to find longest matching prefixes as well as to insert and delete a prefix in O(log n) time, where n is the number of prefixes in the router table is developed. Experiment results using a real IPv4 routing database are also presented.