A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Improved routing strategies with succinct tables
Journal of Algorithms
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Combinatorial theory (2nd ed.)
Combinatorial theory (2nd ed.)
Worst case bounds for shortest path interval routing
Journal of Algorithms
Multidimensional interval routing schemes
Theoretical Computer Science
The complexity of shortest path and dilation bounded interval routing
Theoretical Computer Science
The Compactness of Interval Routing
SIAM Journal on Discrete Mathematics
Theoretical Computer Science
Compact routing with minimum stretch
Journal of Algorithms
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Name independent routing for growth bounded networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On space-stretch trade-offs: upper bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Interval routing in reliability networks
Theoretical Computer Science - Foundations of software science and computation structures
Average stretch analysis of compact routing schemes
Discrete Applied Mathematics
Optimal scale-free compact routing schemes in networks of low doubling dimension
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Compact name-independent routing with minimum stretch
ACM Transactions on Algorithms (TALG)
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Fault-tolerant compact routing schemes for general graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Resilient and low stretch routing through embedding into tree metrics
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Fault-tolerant compact routing schemes for general graphs
Information and Computation
Distributed and compact routing using spatial distributions in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Compact routing schemes with improved stretch
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
This paper presents a routing strategy called Pivot Interval Routing (PIR), which allows message routing on every weighted n-node network along paths whose stretch factor (namely, the ratio between the length of the routing path and the shortest path) is at most five, and whose average stretch factor is at most three, with routing tables of size O(√n log3/2 n) 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. Moreover, it is shown that 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(√n log n) intervals per link. As a result, the schemes are simpler than previous ones and they imply that the paths followed by messages are loop-free. On the other hand, we show that there is no loop-free routing strategy guaranteeing a memory bound of at most √n bits per node for all networks, regardless of the route lengths.