Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs

Toshimitsu Masuzawa Sébastien Tixeuil 1
1 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01303467
Contributor : Lip6 Publications <>
Submitted on : Monday, April 18, 2016 - 11:16:30 AM
Last modification on : Thursday, March 21, 2019 - 2:17:46 PM

Links full text

Identifiers

Citation

Toshimitsu Masuzawa, Sébastien Tixeuil. Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs. 15th International Colloquium on Structural Information and Communication Complexity (Sirocco 2008), Jun 2008, Villars-sur-Ollon, Switzerland. pp.247-261, ⟨10.1007/978-3-540-69355-0_21⟩. ⟨hal-01303467⟩

Share

Metrics

Record views

69