A PROBABILISTIC CHARACTERIZATION OF A FAULT-TOLERANT GOSSIPING ALGORITHM

在线阅读 下载PDF 导出详情
摘要 Gossipingisapopulartechniqueforprobabilisticreliablemulticast(orbroadcast).However,itisoftendifficulttounderstandthebehaviorofgossipingalgorithmsinananalyticfashion.Indeed,existinganalysesofgossipalgorithmsareeitherbasedonsimulationorbasedonideasborrowedfromepidemicmodelswhileinheritingsomefeaturesthatdonotseemtobeappropriateforthesettingofgossiping.Ononehand,inepidemicspreading,aninfectednodetypicallyintendstospreadtheinfectionanunboundednumberoftimes(orrounds);whereasingossiping,aninfectednode(i.e.,anodehavingreceivedthemessageinquestion)mayprefertogossipthemessageaboundednumberoftimes.Ontheotherhand,theoftenassumedhomogeneityinepidemicspreadingmodels(especiallythateverynodehasequalcontacttoeveryoneelseinthepopulation)hasbeensilentlyinheritedinthegossipingliterature,meaningthatanexpensivemembershipprotocolisoftenneededformaintainingnodes'views.Motivatedbytheseobservations,theauthorspresentacharacterizationofapopularclassoffault-tolerantgossipschemes(knownas'push-basedgossiping')basedonanovelprobabilisticmodel,whiletakingtheafore-mentionedfactorsintoconsideration.
机构地区 不详
出版日期 2009年01月11日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献