Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2008-03-03
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
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.
Masuzawa Toshimitsu
Tixeuil Sébastien
No associations
LandOfFree
Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-225123