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 :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01154467
Contributor : Lip6 Publications <>
Submitted on : Friday, May 22, 2015 - 10:07:46 AM
Last modification on : Monday, May 6, 2019 - 11:49:49 AM

Links full text

Identifiers

Citation

Toshimitsu Masuzawa, Sébastien Tixeuil. Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs. Theoretical Computer Science, Elsevier, 2010, 411 (14-15), pp.1567-1582. ⟨10.1016/j.tcs.2010.01.006⟩. ⟨hal-01154467⟩

Share

Metrics

Record views

160