Quiescence of self-stabilizing gossiping among mobile agents in graphs

DOI10.1016/J.TCS.2010.01.006MaRDI QIDQ962163zbMATH OpenOpenAlexFDO

Authors Toshimitsu Masuzawa, Sébastien Tixeuil

Publication date 6 April 2010

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.6346

zbMATH Keywords

distributed algorithmsquiescenceself-stabilizationgossipingagents

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42) Distributed algorithms (68W15)

Recommendations

• Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs
• Move-optimal gossiping among mobile agents
• Self-stabilizing rendezvous of synchronous mobile agents in graphs
• Gossiping by energy-constrained mobile agents in tree networks
• Optimal Moves for Gossiping Among Mobile Agents
• On the Role of Mobility for Multimessage Gossip
• Gossip algorithm for multi-agent systems via random walk
• The Impact of Mobility on Gossip Algorithms
• Robust gossiping with an application to consensus

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?)
• An annotated bibliography on guaranteed graph searching
• Deterministic Rendezvous in Trees with Little Memory
• Deterministic rendezvous in graphs
• How to Meet in Anonymous Network
• Mathematical Foundations of Computer Science 2005
• Memory requirements for silent stabilization
• Move-optimal gossiping among mobile agents
• Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
• Rendezvous and election of mobile agents: Impact of sense of direction
• Searching for a black hole in arbitrary networks, optimal mobile agent protocols
• Self-stabilization
• Stabilizing leader election in partial synchronous systems with crash failures

Cited in

(5)

• Move-optimal gossiping among mobile agents
• Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles
• 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 Q962163)