摘要
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日(中国期刊网平台首次上网日期,不代表论文的发表时间)