グラフ上の移動エージェントによる自己安定ゴシップの静止性
Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs
グラフ上を移動するエージェント間で情報を全員に広めるゴシップ問題に対し、任意の初期状態から自己安定に動作する解法を定式化し、最終的に停止できるエージェント数の最大値(静止数)を様々な仮定の下で解析した。
著者: Toshimitsu Masuzawa, Sébastien Tixeuil
分類: cs.DC, cs.PF, cs.RO
原文アブストラクト
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.
