Information Processing Letters
Introduction to distributed algorithms
Introduction to distributed algorithms
Information Processing Letters
Communicating sequential processes
Communications of the ACM
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Stabilization-Preserving Atomicity Refinement
Proceedings of the 13th International Symposium on Distributed Computing
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Agents, Distributed Algorithms, and Stabilization
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
ICDCS '99 Workshop on Self-stabilizing Systems
Randomized Adaptive Routing Based on Mobile Agents
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Superstabilizing Protocols for Dynamic Distributed Systems
Superstabilizing Protocols for Dynamic Distributed Systems
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Modified tree structure for location management in mobile environments
Computer Communications
Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Quiescence of self-stabilizing gossiping among mobile agents in graphs
Theoretical Computer Science
A method for evaluating efficiency of protocols on the asynchronous shared-state model
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
On the self-stabilization of mobile robots in graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Price stabilization in networks: what is an appropriate model?
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
This paper introduces the problem of n mobile agents that repeatedly visit all n nodes of a given network, subject to the constraint that no two agents can simultaneously occupy a node. It is shown for a tree network and a synchronous model that this problem has O(驴n) upper and lower time bounds where 驴 is the maximum degree of any vertex in the communication network. The synchronous algorithm is self-stabilizing and can also be used for an asynchronous system. A second algorithm is presented and analyzed to show O(n) round complexity for the case of a line of n asynchronous processes.