Quiescence of self-stabilizing gossiping among mobile agents in graphs

被引:2
作者
Masuzawa, Toshimitsu [1 ]
Tixeuil, Sebastien [2 ]
机构
[1] Osaka Univ, Grad Sch Informat Sci & Technol, Suita, Osaka 5650871, Japan
[2] Univ Paris 06, F-75252 Paris 05, France
关键词
Self-stabilization; Gossiping; Quiescence; Agents; Distributed algorithms;
D O I
10.1016/j.tcs.2010.01.006
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:1567 / 1582
页数:16
相关论文
共 19 条
[1]   Rendezvous and election of mobile agents:: Impact of sense of direction [J].
Barriere, Lali ;
Flocchini, Paola ;
Fraigniaud, Pierre ;
Santoro, Nicola .
THEORY OF COMPUTING SYSTEMS, 2007, 40 (02) :143-162
[2]  
BEAUQUIER J, 2001, P 5 WORKSH SELF STAB, P35
[3]  
Blin L, 2007, LECT NOTES COMPUT SC, V4878, P301
[4]  
Delporte-Gallet C, 2007, LECT NOTES COMPUT SC, V4838, P219
[5]   Deterministic rendezvous in graphs [J].
Dessmark, Anders ;
Fraigniaud, Pierre ;
Kowalski, Dariusz R. ;
Pelc, Andrzej .
ALGORITHMICA, 2006, 46 (01) :69-96
[6]   Communication Efficiency in Self-Stabilizing Silent Protocols [J].
Devismes, Stephane ;
Masuzawa, Toshimitsu ;
Tixeuil, Sebastien .
2009 29TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 2009, :474-+
[7]  
Dobrev S., 2002, Proceedings of the Twenty- rst Annual Symposium on Principles of Distributed Computing, P153
[8]   Random walk for self-stabilizing group communication in ad-hoc networks [J].
Dolev, S ;
Schiller, E ;
Welch, J .
21ST IEEE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS, 2002, :70-79
[9]   Memory requirements for silent stabilization [J].
Dolev, S ;
Gouda, MG ;
Schneider, M .
ACTA INFORMATICA, 1999, 36 (06) :447-462
[10]  
Dolev S., 2000, Self-Stabilization