Exactly-once delivery in a content-based publish-subscribe system

S. Bhola, R. Strom, S. Bagchi, Yuanyuan Zhao, Joshua S. Auerbach
{"title":"Exactly-once delivery in a content-based publish-subscribe system","authors":"S. Bhola, R. Strom, S. Bagchi, Yuanyuan Zhao, Joshua S. Auerbach","doi":"10.1109/DSN.2002.1028881","DOIUrl":null,"url":null,"abstract":"This paper presents a general knowledge model for propagating information in a content-based publish-subscribe system. The model is used to derive an efficient and scalable Protocol for exactly-once delivery to large numbers (tens of thousands per broker) of content-based subscribers in either publisher order or uniform total order Our protocol allows intermediate content filtering at each hop, but requires persistent storage only at the publishing site. It is tolerant of message drops, message reorderings, node failures, and link failures, and maintains only \"soft\" state at intermediate nodes. We evaluate the performance of our implementation both under failure-free conditions and with fault injection.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"72 1","pages":"7-16"},"PeriodicalIF":0.0000,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"147","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Conference on Dependable Systems and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSN.2002.1028881","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 147

Abstract

This paper presents a general knowledge model for propagating information in a content-based publish-subscribe system. The model is used to derive an efficient and scalable Protocol for exactly-once delivery to large numbers (tens of thousands per broker) of content-based subscribers in either publisher order or uniform total order Our protocol allows intermediate content filtering at each hop, but requires persistent storage only at the publishing site. It is tolerant of message drops, message reorderings, node failures, and link failures, and maintains only "soft" state at intermediate nodes. We evaluate the performance of our implementation both under failure-free conditions and with fault injection.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在基于内容的发布-订阅系统中只交付一次
提出了一种在基于内容的发布-订阅系统中传播信息的通用知识模型。该模型用于导出一种高效且可扩展的协议,用于以发布者顺序或统一的总顺序向大量(每个代理数万个)基于内容的订阅者只交付一次。我们的协议允许在每一跳进行中间内容过滤,但只需要在发布站点进行持久存储。它可以容忍消息丢失、消息重排序、节点故障和链路故障,并且只在中间节点保持“软”状态。我们评估了我们的实现在无故障条件和故障注入条件下的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Practical and Efficient in-Enclave Verification of Privacy Compliance. Evaluating the security threat of firewall data corruption caused by instruction transient errors Application performance assurance using end-to-end user level monitoring Small byzantine quorum systems CLAIRE: an event-driven simulation tool for test and validation of software programs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1