Back to Search
Start Over
Quiescence of self-stabilizing gossiping among mobile agents in graphs
- Source :
-
Theoretical Computer Science . Mar2010, Vol. 411 Issue 14/15, p1567-1582. 16p. - Publication Year :
- 2010
-
Abstract
- Abstract: 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 411
- Issue :
- 14/15
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 48405196
- Full Text :
- https://doi.org/10.1016/j.tcs.2010.01.006