A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Graphs with small bandwidth and cutwidth
Discrete Mathematics
Improved routing strategies with succinct tables
Journal of Algorithms
Locality in distributed graph algorithms
SIAM Journal on Computing
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Local management of a global resource in a communication network
Journal of the ACM (JACM)
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
SIAM Journal on Computing
Approximating the bandwidth via volume respecting embeddings
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
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
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Compact routing for average-case networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Labeling Schemes for Dynamic Tree Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Measured Descent: A New Embedding Method for Finite Metrics
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Upper and lower bounds for routing schemes in dynamic networks
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Labeling schemes for weighted dynamic trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximating the bandwidth of caterpillars
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Improved compact routing schemes for dynamic trees
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A compact routing architecture for mobility
Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Efficient threshold detection in a distributed environment: extended abstract
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Controller and estimator for dynamic networks
Information and Computation
Sublinear-Time maintenance of breadth-first spanning tree in partially dynamic networks
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
This article studies approximate distributed routing schemes on dynamic communication networks. The work focuses on dynamic weighted general graphs where the vertices of the graph are fixed, but the weights of the edges may change. Our main contribution concerns bounding the cost of adapting to dynamic changes. The update efficiency of a routing scheme is measured by the time needed in order to update the routing scheme following a weight change. A naive dynamic routing scheme, which updates all vertices following a weight change, requires Ω(Diam) time in order to perform the updates after every weight change, where Diam is the diameter of the underlying graph. In contrast, this article presents approximate dynamic routing schemes with average time complexity Θ˜(D) per topological change, where D is the local density parameter of the underlying graph. Following a weight change, our scheme never incurs more than Diam time; thus, our scheme is particularly efficient on graphs which have low local density and large diameter. The article also establishes upper and lower bounds on the size of the databases required by the scheme at each site.