Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs

DOI10.1007/978-3-540-69355-0_21MaRDI QIDQ3511403zbMATH OpenOpenAlexFDO

Authors Toshimitsu Masuzawa, Sébastien Tixeuil

Publication date 10 July 2008

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0803.0189

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

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.

Recommendations

• Quiescence of self-stabilizing gossiping among mobile agents in graphs
• Move-optimal gossiping among mobile agents
• Optimal Moves for Gossiping Among Mobile Agents
• Self-stabilizing rendezvous of synchronous mobile agents in graphs
• scientific article; zbMATH DE number 2036576

Cites work

• scientific article; zbMATH DE number 1696640 (Why is no real title available?)
• scientific article; zbMATH DE number 2036568 (Why is no real title available?)
• scientific article; zbMATH DE number 2036576 (Why is no real title available?)
• Memory requirements for silent stabilization
• Move-optimal gossiping among mobile agents
• Rendezvous and election of mobile agents: Impact of sense of direction
• Self-stabilization

Cited in

(5)

• Move-optimal gossiping among mobile agents
• Self-* properties through gossiping
• Quiescence of self-stabilizing gossiping among mobile agents in graphs
• scientific article; zbMATH DE number 2036576 (Why is no real title available?)
• Optimal Moves for Gossiping Among Mobile Agents

This page was built for publication: Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511403)