Self-stabilization
Searching for a black hole in arbitrary networks: optimal mobile agent protocols
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Self-Stabilizing Agent Traversal
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Easy Stabilization with an Agent
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Deterministic Rendezvous in Graphs
Algorithmica
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
Theory of Computing Systems
Move-optimal gossiping among mobile agents
Theoretical Computer Science
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Communication Efficiency in Self-Stabilizing Silent Protocols
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
On the self-stabilization of mobile robots in graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Robust stabilizing leader election
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Nondeterministic graph searching: from pathwidth to treewidth
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The reduced automata technique for graph exploration space lower bounds
Theoretical Computer Science
| Hi-index | 5.24 |
This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions for the gossip problem, where agents may start from arbitrary locations in arbitrary states. Self-stabilization requires (some of the) participating agents to keep moving forever, hinting at maximizing the number of agents that could be allowed to stop moving eventually. This paper formalizes the self-stabilizing agent gossip problem, introduces the quiescence number (i.e., the maximum number of eventually stopping agents) of self-stabilizing solutions and investigates the quiescence number with respect to several assumptions related to agent anonymity, synchrony, link duplex capacity, and whiteboard capacity.