A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
A parallel algorithm for finding a separator in planar graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Distributed routing in tree networks with few landmarks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
A Deterministic Linear Time Algorithm For Geometric Separators And Its Applications
Fundamenta Informaticae
| Hi-index | 0.00 |
Message routing strategies are given for networks with certain separator properties. These strategies use considerably less space than complete routing tables, keep node names to O(log n) bits, and still route along near-shortest paths. For any network with separators of size at most a small constant c, a total of O(n log n) items of routing information is stored, and any message is routed along a path of length at most (2/α) + 1 times the length of an optimal path, where α 1 is the positive root of the equation α⌈(c+1)/2⌉ - α - 2 = 0. For planar networks, O(n1+ε) items are stored, for any constant ε, 0