Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs

DOI10.1007/978-3-540-69355-0_21zbMATH Open1143.68338arXiv0803.0189OpenAlexW3023209205MaRDI QIDQ3511403FDOQ3511403

Authors: Toshimitsu Masuzawa, Sébastien Tixeuil 

Publication date: 10 July 2008

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

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.

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

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

Mathematics Subject Classification ID

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

Cites Work

• Self-stabilization
• Memory requirements for silent stabilization
• Rendezvous and election of mobile agents: Impact of sense of direction
• Move-optimal gossiping among mobile agents
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Quiescence of self-stabilizing gossiping among mobile agents in graphs
• Title not available (Why is that?)
• Optimal Moves for Gossiping Among Mobile Agents
• Self-* properties through gossiping
• Move-optimal 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)