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
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
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
Routing in distributed networks: overview and open problems
ACM SIGACT News
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
General compact labeling schemes for dynamic trees
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On compact routing for the internet
ACM SIGCOMM Computer Communication Review
Controller and estimator for dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Simulating Routing Schemes on Large-Scale Topologies
PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
| Hi-index | 0.00 |
This paper studies approximate distributed routing schemes on dynamic communication networks. The paper 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 number of messages that need to be sent, following a weight change, in order to update the scheme. Our results indicate that the graph theoretic parameter governing the amortized message complexity of these updates is the local density D of the underlying graph, and specifically, this complexity is ${\tilde\Theta}(D)$. The paper also establishes upper and lower bounds on the size of the databases required by the scheme at each site.