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
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Communications of the ACM
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
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Journal of Algorithms
Routing in distributed networks: overview and open problems
ACM SIGACT News
A Space Lower Bound for Routing in Trees
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Compact routing with name independence
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Brief announcement: name-independent compact routing in trees
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distance estimation and object location via rings of neighbors
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
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
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Name-independent compact routing in trees
Information Processing Letters
Strong-diameter decompositions of minor free graphs
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
On compact routing for the internet
ACM SIGCOMM Computer Communication Review
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Towards fast decentralized construction of locality-aware overlay networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Linked decompositions of networks and the power of choice in Polya urns
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Compact roundtrip routing with topology-independent node names
Journal of Computer and System Sciences
NetComplex: a complexity metric for networked system designs
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Distributed algorithms for ultrasparse spanners and linear size skeletons
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Design considerations for a network of information
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Scalable routing on flat names
Proceedings of the 6th International COnference
Practical locality-awareness for large scale information sharing
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
A self-organizing routing scheme for random networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Geometric routing without geometry
SIROCCO'05 Proceedings of the 12th 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
Robust locality-aware lookup networks
Self-star Properties in Complex Information Systems
Compact routing schemes with improved stretch
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Given a weighted undirected network with arbitrary node names, we present a compact routing scheme, using a Õ(√n) space routing table at each node, and routing along paths of stretch 3, that is, at most thrice as long as the shortest paths. This is optimal in a very strong sense. It is known that no compact routing using o(n) space per node can route with stretch below 3. Also, it is known that any stretch below 5 requires Ω(√n) space per node.