Epidemic algorithms for reliable content-based publish-subscribe: an evaluation

Paolo Costa, Matteo Migliavacca, G. Picco, G. Cugola
{"title":"Epidemic algorithms for reliable content-based publish-subscribe: an evaluation","authors":"Paolo Costa, Matteo Migliavacca, G. Picco, G. Cugola","doi":"10.1109/ICDCS.2004.1281622","DOIUrl":null,"url":null,"abstract":"Distributed content-based publish-subscribe middleware is emerging as a promising answer to the demands of modern distributed computing. Nevertheless, currently available systems usually do not provide reliability guarantees. This hampers their use in dynamic and unreliable scenarios, notably including mobile ones. We evaluate the effectiveness of an approach based on epidemic algorithms. Three algorithms we originally proposed in [P. Costa et al., (2003)] are thoroughly compared and evaluated through simulation in challenging unreliable settings. The results show that our use of epidemic algorithms improves significantly event delivery, is scalable, and introduces only limited overhead.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"96","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2004.1281622","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 96

Abstract

Distributed content-based publish-subscribe middleware is emerging as a promising answer to the demands of modern distributed computing. Nevertheless, currently available systems usually do not provide reliability guarantees. This hampers their use in dynamic and unreliable scenarios, notably including mobile ones. We evaluate the effectiveness of an approach based on epidemic algorithms. Three algorithms we originally proposed in [P. Costa et al., (2003)] are thoroughly compared and evaluated through simulation in challenging unreliable settings. The results show that our use of epidemic algorithms improves significantly event delivery, is scalable, and introduces only limited overhead.
可靠的基于内容的发布-订阅流行算法:评估
基于内容的分布式发布-订阅中间件作为现代分布式计算需求的一种很有希望的解决方案正在出现。然而,目前可用的系统通常不能提供可靠性保证。这阻碍了它们在动态和不可靠场景中的使用,特别是在移动场景中。我们评估了一种基于流行病算法的方法的有效性。我们最初在[P.]Costa等人,(2003)]在具有挑战性的不可靠环境中通过模拟进行了彻底的比较和评估。结果表明,我们使用的流行算法显著改善了事件传递,具有可扩展性,并且只引入了有限的开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信