Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Distance-dependent distributed directories
Information and Computation
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
Near-Linear Time Construction of Sparse Neighborhood Covers
SIAM Journal on Computing
Compact roundtrip routing for digraphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Compact roundtrip routing in directed networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Compact routing with stretch factor of less than three (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
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
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Roundtrip spanners and roundtrip routing in directed graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Routing in distributed networks: overview and open problems
ACM SIGACT News
Compact routing for average-case networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Compact routing with name independence
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Compact roundtrip routing with topology-independent node names
Proceedings of the twenty-second annual symposium on Principles of distributed computing
All pairs almost shortest paths
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Compact roundtrip routing in directed networks
Journal of Algorithms
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: name-independent compact routing in trees
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On space-stretch trade-offs: lower bounds
Proceedings of the eighteenth 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
Compact Routing with Name Independence
SIAM Journal on Discrete Mathematics
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Consider a strongly connected directed weighted network with n nodes. This paper presents compact roundtrip routing schemes with O@?(n) sized local tables and stretch 6 for any strongly connected directed network with arbitrary edge weights. A scheme with local tables of size O@?(@e^-^1n^2^/^k) and stretch min((2^k^/^2-1)(k+@e),8k^2+4k-4), for any @e0 is also presented in the case where edge weights are restricted to be polynomially-sized. Both results are for the topology-independent node-name model. These are the first topology-independent results that apply to routing in directed networks.