Complexity of network synchronization
Journal of the ACM (JACM)
An upper bound for the k-domination number of a graph
Journal of Graph Theory
Establishing virtual circuits in large computer networks
Computer Networks and ISDN Systems
The Computer Journal
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Compact distributed data structures for adaptive routing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Separator-based strategies for efficient message routing
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Concurrent online tracking of mobile users
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Adapting to asynchronous dynamic networks (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Online tracking of mobile users
Journal of the ACM (JACM)
Topology aggregation for hierarchical routing in ATM networks
ACM SIGCOMM Computer Communication Review
Space-efficient routing in vertex-symmetric networks (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Memory requirement for universal routing schemes
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Fast distributed construction of k-dominating sets and applications
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Bubbles: adaptive routing scheme for high-speed dynamic networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant routing in hypercubes using masked interval routing scheme
Proceedings of the 1999 ACM symposium on Applied computing
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Compact roundtrip routing for digraphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Compact roundtrip routing in directed networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Multi-Level Communication: Efficient Routing for Interconnection Networks
The Journal of Supercomputing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Static and dynamic low-congested interval routing schemes
Theoretical Computer Science
Routing in distributed networks: overview and open problems
ACM SIGACT News
Crankback Prediction in Hierarchical ATM Networks
Journal of Network and Systems Management
The complexity of the characterization of networks supporting shortest-path interval routing
Theoretical Computer Science
Compact Routing in Directed Networks with Stretch Factor of Two
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Constructing the Spanners of Graphs in Parallel
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Compact Routing Tables for Graphs of Bounded Genus
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Space Lower Bound for Routing in Trees
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
An Additive Stretched Routing Scheme for Chordal Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Interval routing in some planar networks
Theoretical Computer Science
Compact routing schemes with low stretch factor
Journal of Algorithms
Active Robust Resource Management in Cluster Computing Using Policies
Journal of Network and Systems Management
Proceedings of the 1st international conference on Embedded networked sensor systems
The compactness of adaptive routing tables
Journal of Discrete Algorithms
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Compact roundtrip routing in directed networks
Journal of Algorithms
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A distributed algorithm to find k-dominating sets
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Journal of Algorithms
Sparse source-wise and pair-wise distance preservers
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
New constructions of (α, β)-spanners and purely additive spanners
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
Spanners and emulators with sublinear distance errors
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Interval routing in reliability networks
Theoretical Computer Science - Foundations of software science and computation structures
Content-based communication: a research agenda
Proceedings of the 6th international workshop on Software engineering and middleware
Average stretch analysis of compact routing schemes
Discrete Applied Mathematics
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms
Dynamic algorithms for graph spanners
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Compact routing with slack in low doubling dimension
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Spanners for bounded tree-length graphs
Theoretical Computer Science
Fully dynamic algorithm for graph spanners with poly-logarithmic update time
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms (TALG)
On the locality of distributed sparse spanner construction
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Hierarchical routing in ad hoc networks using k-dominating sets
ACM SIGMOBILE Mobile Computing and Communications Review
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the forty-first annual ACM symposium on Theory of computing
Fault-tolerant spanners for general graphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
ACM Transactions on Algorithms (TALG)
As Good as It Gets: Competitive Fault Tolerance in Network Structures
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes
Mobile Networks and Applications
A simple linear time algorithm for computing a (2k - 1)-spanner of o(n1+1/k) size in weighted graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Compact routing in power-law graphs
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Additive spanners in nearly quadratic time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Lower bounds for local monotonicity reconstruction from transitive-closure spanners
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ACM Transactions on Algorithms (TALG)
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Scalable network-on-chip architecture for configurable neural networks
Microprocessors & Microsystems
Fault Tolerant Spanners for General Graphs
SIAM Journal on Computing
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Transitive-closure spanners: a survey
Property testing
Transitive-closure spanners: a survey
Property testing
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Journal of Computer and System Sciences
Improved approximation for the directed spanner problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Fault-tolerant compact routing schemes for general graphs
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
The south zone: distributed algorithms for alliances
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distributed routing in tree networks with few landmarks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Dynamic routing schemes for general graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Distributed computing of efficient routing schemes in generalized chordal graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
On the efficiency of routing in sensor networks
Journal of Parallel and Distributed Computing
Distributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science
Fully dynamic randomized algorithms for graph spanners
ACM Transactions on Algorithms (TALG)
Label cover instances with large girth and the hardness of approximating basic k-spanner
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Space lower bounds for low-stretch greedy embeddings
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG)
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Improved distance oracles and spanners for vertex-labeled graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Fault-tolerant compact routing schemes for general graphs
Information and Computation
Approximation algorithms for spanner problems and Directed Steiner Forest
Information and Computation
Controller and estimator for dynamic networks
Information and Computation
Fault tolerant additive spanners
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Trap array: a unified model for scalability evaluation of geometric routing
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Compact routing schemes with improved stretch
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Fast routing table construction using small messages: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.01 |
Two conflicting goals play a crucial role in the design of routing schemes for communication networks. A routing scheme should use paths that are as short as possible for routing messages in the network, while keeping the routing information stored in the processors' local memory as succinct as possible. The efficiency of a routing scheme is measured in terms of its stretch factor-the maximum ratio between the length of a route computed by the scheme and that of a shortest path connecting the same pair of vertices. Most previous work has concentrated on finding good routing schemes (with a small fixed stretch factor) for special classes of network topologies. In this paper the problem for general networks is studied, and the entire range of possible stretch factors is examined. The results exhibit a trade-off between the efficiency of a routing scheme and its space requirements. Almost tight upper and lower bounds for this trade-off are presented. Specifically, it is proved that any routing scheme for general n-vertex networks that achieves a stretch factor k ≥ 1 must use a total of &OHgr;(n1+1/(2k+4)) bits of routing information in the networks. This lower bound is complemented by a family K(k) of hierarchical routing schemes (for every k ≥ l) for unit-cost general networks, which guarantee a stretch factor of O(k), require storing a total of O(k3n1+(1/h)logn)- bits of routing information in the network, name the vertices with O(log2n)-bit names and use O(logn)-bit headers.