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
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LIFL - Laboratoire d'Informatique Fondamentale de Lille, LRI - Laboratoire de Recherche en Informatique
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 metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00260011
Contributor : Sébastien Tixeuil <>
Submitted on : Tuesday, March 4, 2008 - 7:21:10 PM
Last modification on : Thursday, March 21, 2019 - 1:07:51 PM
Long-term archiving on : Thursday, September 23, 2010 - 4:50:37 PM

Files

rapport.pdf
Files produced by the author(s)

Identifiers

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

Citation

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⟩

Share

Metrics

Record views

379

Files downloads

359