Chord网络环境下的Gossip算法  

Gossip Algorithm in Chord Like Network

作　　者：刘德辉[1,2] 尹刚[1] 王怀民[1] 邹鹏[1] 

机构地区：[1]国防科学技术大学计算机学院,湖南长沙410073 [2]中国人民解放军国际关系学院,江苏南京210039

出　　处：《计算机工程与科学》2011年第9期48-51,共4页Computer Engineering & Science

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

摘　　要：本文研究和分析Gossip算法在Chord网络中的适用性,并根据Chord网络的特点对基于Push&Pull模式的Gossip算法提出一种改进算法Mod-Gossip。实验表明,Push&Pull模式的Gossip算法可以很好地适应Chord网络,在Chord网络中将任意节点上的信息传播到整个网络中需要的周期数与在全连通网络中相当;本文所提出的Mod-Gossip算法则可以减少大约两个周期;在动态网络中,节点的加入不会对Push&Pull模式的Gossip算法以及Mod-Gossip算法的执行产生影响。In this paper, we study applicability 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 execu- tion of the push ＆ pull style Gossip algorithm and Mod-Gossip.

关 键 词：GOSSIP CHORD push&pull 周期 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]