Publiy+: A Peer-Assisted Publish/Subscribe Service for Timely Dissemination of Bulk Content

R. Kazemzadeh, H. Jacobsen
{"title":"Publiy+: A Peer-Assisted Publish/Subscribe Service for Timely Dissemination of Bulk Content","authors":"R. Kazemzadeh, H. Jacobsen","doi":"10.1109/ICDCS.2012.62","DOIUrl":null,"url":null,"abstract":"Publish/Subscribe (P/S) systems and file sharing applications traditionally share the common goal of disseminating data among large populations of users. Despite this similarity, the former focuses on timely dissemination of small-sized notification messages, while the latter presumes larger types of bulk content with less emphasis on the time needed between release and delivery of data. In this paper, we develop a peer-assisted content dissemination mechanism to bridge this gap by adopting the P/S model. We propose a hybrid two-layer architecture in which P/S brokers act as coordinators and guide their clients with interest in similar content to engage in direct exchange of data blocks in a peer-to-peer and cooperative fashion. Furthermore, we use network coding in order to facilitate data exchange among clients. Our peer-assisted scheme offloads the burden of disseminating huge volumes of data from P/S brokers to subscribers themselves. As an added advantage of our approach, brokers employ strategies that help shape traffic flows in multi-domain network settings. Finally, we have implemented our approach and carried out extensive large-scale experimental evaluation on a cluster with aggregate data transfers of up to 1 TB and involving up to 1000 subscribers. Our results demonstrate good scalability and faster content delivery compared to file sharing protocols such as BitTorrent.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":"8 1","pages":"345-354"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 32nd International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2012.62","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Publish/Subscribe (P/S) systems and file sharing applications traditionally share the common goal of disseminating data among large populations of users. Despite this similarity, the former focuses on timely dissemination of small-sized notification messages, while the latter presumes larger types of bulk content with less emphasis on the time needed between release and delivery of data. In this paper, we develop a peer-assisted content dissemination mechanism to bridge this gap by adopting the P/S model. We propose a hybrid two-layer architecture in which P/S brokers act as coordinators and guide their clients with interest in similar content to engage in direct exchange of data blocks in a peer-to-peer and cooperative fashion. Furthermore, we use network coding in order to facilitate data exchange among clients. Our peer-assisted scheme offloads the burden of disseminating huge volumes of data from P/S brokers to subscribers themselves. As an added advantage of our approach, brokers employ strategies that help shape traffic flows in multi-domain network settings. Finally, we have implemented our approach and carried out extensive large-scale experimental evaluation on a cluster with aggregate data transfers of up to 1 TB and involving up to 1000 subscribers. Our results demonstrate good scalability and faster content delivery compared to file sharing protocols such as BitTorrent.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
发布+:一种同行协助的发布/订阅服务,用于及时传播大量内容
发布/订阅(P/S)系统和文件共享应用程序传统上都有一个共同的目标,即在大量用户中传播数据。尽管有这种相似之处,前者侧重于及时传播小型通知消息,而后者则假定更大类型的批量内容,而不太强调发布和交付数据之间所需的时间。在本文中,我们开发了一个对等辅助的内容传播机制,通过采用P/S模型来弥补这一差距。我们提出了一种混合的两层架构,其中P/S代理作为协调者,引导对类似内容感兴趣的客户以点对点和合作的方式直接交换数据块。此外,我们使用网络编码,以方便客户端之间的数据交换。我们的对等辅助方案减轻了从P/S经纪人向订户自己传播大量数据的负担。作为我们方法的一个额外优势,代理采用有助于在多域网络设置中塑造流量的策略。最后,我们已经实施了我们的方法,并在一个集群上进行了广泛的大规模实验评估,该集群的总数据传输量高达1tb,涉及多达1000个订阅者。我们的结果表明,与BitTorrent等文件共享协议相比,具有良好的可扩展性和更快的内容交付速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Design and Simulation of Multiple Quantum well based InGaN/GaN Light Emitting Diode for High power applications Virtual Reality based System for Training and Monitoring Fire Safety Awareness for Children with Autism Spectrum Disorder A Cognitive Based Channel Assortment Using Ant-Colony Optimized Stable Path Selection in an IoTN Design and Implementation of DNA Based Cryptographic Algorithm A Compact Wearable 2.45 GHz Antenna for WBAN Applications
×
引用
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