Covering-Based Routing Algorithms for Cyclic Content-Based P/S Overlays

在线阅读 下载PDF 导出详情
摘要 Content-basedrouting(CBR)publish/subscribe(P/S)systemisanimportantclassofdistributedsystems.Thissystemdiffersfromclassicalparadigmsasmessagesareroutedbasedontheircontentratherthantheirdestinationaddress,soastoprovideafine-granularityeventdissemination,andsupportmoreflexibilitydecouplingapplications.Covering-basedroutingisatypicaloptimizationmethodofCBRandhasbeenwidelyusedasabuildingblockinmanydistributedP/Ssystems,foritmaintainsacompactroutingtableandreducesthecostsofcommunicationsandmatchingcomputations.Sofarasweknow,thisoptimizationmethodcanonlybeimplementedonacyclicoverlaynetwork,butcannotbedirectlyutilizedoncyclicnetworks.AstheCBRincyclicsystemsbecomesanewfocusofresearch,developingcovering-basedprotocolsandalgorithmsforcyclicP/Ssystemisbecomingsignificantlyimportant.Thispapercontributesthecycliccovering-basedroutingprotocolwithcorrespondingalgorithmstosupportcovering-basedprotocolincyclicP/Ssystem,andimplementsitinPADRES,adistributedeventmanagementinfrastructurebasedonthepublish/subscribemodel.
机构地区 不详
出版日期 2010年06月16日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献