• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2011, Vol. 33 ›› Issue (9): 48-51.

• 论文 • 上一篇    下一篇

Chord网络环境下的Gossip算法

刘德辉1,2,尹刚1,王怀民1,邹鹏1   

  1. (1.国防科学技术大学计算机学院,湖南 长沙 410073;2.中国人民解放军国际关系学院,江苏 南京 210039)
  • 收稿日期:2009-11-26 修回日期:2010-04-12 出版日期:2011-09-25 发布日期:2011-09-25
  • 作者简介:刘德辉(1979),男,江苏建湖人,博士生,研究方向为分布计算。
  • 基金资助:

    国家973计划资助项目(2005CB321800);国家自然科学基金资助项目(60903043)

Technology,Changsha,Hunan 410073,P.R.China Gossip Algorithm in Chord Like Network

LIU Dehui1,2,YIN Gang1,WANG Huimin1,ZOU Peng1   

  1. (1.School of Computer Science,National University of Defense Technology,Changsha 410073;
    2.The PLA Institute of International Relations,Nanjing 210039,China)
  • Received:2009-11-26 Revised:2010-04-12 Online:2011-09-25 Published:2011-09-25

摘要:

本文研究和分析Gossip算法在Chord网络中的适用性, 并根据Chord网络的特点对基于Push&Pull模式的Gossip算法提出一种改进算法ModGossip。实验表明,Push&Pull模式的Gossip算法可以很好地适应Chord网络,在Chord网络中将任意节点上的信息传播到整个网络中需要的周期数与在全连通网络中相当;本文所提出的ModGossip算法则可以减少大约两个周期;在动态网络中,节点的加入不会对Push&Pull模式的Gossip算法以及ModGossip算法的执行产生影响。

关键词: Gossip, Chord, push &, pull, 周期

Abstract:

In this paper, we study the applicability of the Gossip algorithm in the Chord networks. We propose ModGossip, an improved push & pull style Gossip algorithm according to the characteristics of Chord. The simulation results show that the push & pull style Gossip algorithm can be applied in the Chord networks, and the rounds needed to spread the information of one node to the whole network in the Chord networks is approximately the same as that in a fully connected network. However, ModGossip can save about 2 rounds. In dynamic networks, the joining of nodes will not influence the execution of the push & pull style Gossip algorithm and ModGossip.

Key words: Gossip;Chord;push &, pull;round