A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Improved routing strategies with succinct tables
Journal of Algorithms
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Worst case bounds for shortest path interval routing
Journal of Algorithms
Multidimensional interval routing schemes
Theoretical Computer Science
Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
SIAM Journal on Computing
The Compactness of Interval Routing
SIAM Journal on Discrete Mathematics
Theoretical Computer Science
A Lower Bound for Linear Interval Routing
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
The Compactness of Interval Routing for Almost All Graphs
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
The Complexity of Shortest Path and Dilation Bounded Interval Routing
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Compact routing schemes with low stretch factor
Journal of Algorithms
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Hi-index | 0.04 |
This paper presents some analytic results concerning the pivot interval routing (PIR) strategy of [T. Eilam, C. Gavoille, D. Peleg, Compact routing schemes with low stretch factor, J. Algorithms 46(2) (2003) 97-114, Preliminary version appeared. in: Proceedings of the 17th ACM Symposium on Principles of Distributed Computing, June 1998, pp. 11-20.] That strategy allows message routing on every weighted n-node network along paths whose stretch (namely, the ratio between their length and the distance between their endpoints) is at most five, and whose average stretch is at most three, with routing tables of size O(nlog^3^/^2n) bits per node. In addition, the route lengths are at most 2D (@?1.5D@? for uniform weights) where D is the weighted diameter of the network. The PIR strategy can be constructed in polynomial time and can be implemented so that the generated scheme is in the form of an interval routing scheme (IRS), using at most O(nlogn) intervals per link. Here, it is shown that there exists an unweighted n-node graph G and an identity assignment ID for its nodes such that for every R@?PIR on G with a set of pivots computed by a greedy cover algorithm (respectively, a randomized algorithm), AvStr"G(R)3-o(1) (respectively, with high probability). Also, it is shown that for almost every unweighted n-node graph G, and for every R@?PIR on G, AvStr"G(R)=1.875+/-o(1). A comparison between PIR and HCP"k, the hierarchical routing strategy presented in [B. Awerbuch, A. Bar-Noy, N. Linial, D. Peleg, Improved routing strategies with succinct tables, J. Algorithms 11 (1990) 307-341.] is also given.