Skip to Main content Skip to Navigation

Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs

Toshimitsu Masuzawa 1 Sébastien Tixeuil 2, 3 
3 GRAND-LARGE - Global parallel and distributed computing
LRI - Laboratoire de Recherche en Informatique, LIFL - Laboratoire d'Informatique Fondamentale de Lille, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
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.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Sébastien Tixeuil Connect in order to contact the contributor
Submitted on : Tuesday, March 4, 2008 - 7:21:10 PM
Last modification on : Tuesday, July 5, 2022 - 8:38:30 AM
Long-term archiving on: : Thursday, September 23, 2010 - 4:50:37 PM


Files produced by the author(s)


  • HAL Id : inria-00260011, version 3
  • ARXIV : 0803.0189


Toshimitsu Masuzawa, Sébastien Tixeuil. Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs. [Research Report] RR-6458, INRIA. 2008, pp.20. ⟨inria-00260011v3⟩



Record views


Files downloads