A Simple Broadcast Algorithm for Recurrent Dynamic Systems

被引：8
作者：
Raynal, Michel [1 ,2 ]
Stainer, Julien [2 ]
Cao, Jiannong [3 ]
Wu, Weigang [4 ]
机构：
[1] Inst Univ France, Rennes, France
[2] Univ Rennes, IRISA, F-35042 Rennes, France
[3] Hong Kong Polytech Univ, Dept Comp, Kowloon, Hong Kong, Peoples R China
[4] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510006, Guangdong, Peoples R China
来源：
2014 IEEE 28TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA) | 2014年
关键词：
Bounded delay; Broadcast; Distributed algorithm; Dynamic network; Mobile entity; Unbounded recurrence; Recurrent link;
D O I：
10.1109/AINA.2014.115
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper presents a simple broadcast algorithm suited to dynamic systems where links can repeatedly appear and disappear. The algorithm is proved correct and a simple improvement is introduced, that reduces the number and the size of control messages. As it extends in a simple way a classical network traversal algorithm to the dynamic context, the proposed algorithm has also pedagogical flavor.
引用
收藏
页码：933 / 939
页数：7
相关论文
共 22 条
  • [1] RELIABLE COMMUNICATION OVER UNRELIABLE CHANNELS
    AFEK, Y
    ATTIYA, H
    FEKETE, A
    FISCHER, M
    LYNCH, N
    MANSOUR, Y
    WANG, DW
    [J]. JOURNAL OF THE ACM, 1994, 41 (06) : 1267 - 1297
  • [2] Aguilera M.K., 2004, DISTRIB COMPUT COLUM, V35, P36, DOI DOI 10.1145/992287.992298
  • [3] On quiescent reliable communication
    Aguilera, MK
    Chen, W
    Toueg, S
    [J]. SIAM JOURNAL ON COMPUTING, 2000, 29 (06) : 2040 - 2073
  • [4] Computation in networks of passively mobile finite-state sensors
    Angluin, D
    Aspnes, J
    Diamadi, Z
    Fischer, MJ
    Peralta, R
    [J]. DISTRIBUTED COMPUTING, 2006, 18 (04) : 235 - 253
  • [5] The computational power of population protocols
    Angluin, Dana
    Aspnes, James
    Eisenstat, David
    Ruppert, Eric
    [J]. DISTRIBUTED COMPUTING, 2007, 20 (04) : 279 - 304
  • [6] [Anonymous], 2013, DISTRIBUTED ALGORITH, DOI DOI 10.1007/978-3-642-38123-2
  • [7] [Anonymous], 1984, P 3 ANN ACM S PRINCI
  • [8] Baldoni R, 2007, LECT NOTES COMPUT SC, V4671, P1
  • [9] Biely Martin, 2012, Structural Information and Communication Complexity. Proceedings 19th International Colloquium (SIROCCO 2012), P73, DOI 10.1007/978-3-642-31104-8_7
  • [10] Casteigts A, 2012, INT J PARALLEL EMERG, V27, P387, DOI [10.1080/17445760.2012.668546, 10.1007/978-3-642-22450-8_27]
123