GS3: scalable self-configuration and self-healing in wireless networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Locating Information with Uncertainty in Fully Interconnected Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Searching with Mobile Agents in Networks with Liars
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
GS3: scalable self-configuration and self-healing in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms (TALG)
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Theoretical Computer Science
Empire of Colonies: self-stabilizing and self-organizing distributed algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Dynamic routing schemes for general graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
| Hi-index | 0.00 |
This paper presents the first dynamic routing scheme for high-speed networks. The scheme is based on a hierarchical bubbles partition of the underlying communication graph. Dynamic routing schemes are ranked by their adaptability, i.e., the maximum number of sites to be updated upon a topology change. An advantage of our scheme is that it implies a small number of updates upon a topology change. In particular, for the case of a bounded degree network it is proved that our scheme is optimal in its adaptability by presenting a matching tight lower bound. Our bubble routing scheme is a combination of a distributed routing database, a routing strategy, and a routing database update. It is shown how to perform the routing database update on a dynamic network in a distributed manner.