可靠的P2P馈送

Anwitaman Datta, Xin Liu
{"title":"可靠的P2P馈送","authors":"Anwitaman Datta, Xin Liu","doi":"10.1109/CCGRID.2009.32","DOIUrl":null,"url":null,"abstract":"Using peer-to-peer overlays to notify users whenevera new update occurs is a promising approach to supportweb based publish subscribe systems like really simple syndication (RSS). Such a peer-to-peer approach can scale well by reducing load at the source and also guarantee timeliness of notifications. Several such overlay based approaches have been proposed in recent years. However, malicious peers may pretend to relay but actually not, and thus deny service, or even propagate counterfeit updates - thus rendering a peer-to-peer mechanism not only useless, but even harmful (e.g., by false updates). We propose overlay independent randomized strategies to mitigate these ill-effects of malicious peers at a marginal overhead, thus enjoying the benefits of peer-to-peer dissemination, along with the assurance of content integrity in RSS like web-based publish-subscribe applications without altering currently deployed server infrastructure.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Reliable P2P Feed Delivery\",\"authors\":\"Anwitaman Datta, Xin Liu\",\"doi\":\"10.1109/CCGRID.2009.32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Using peer-to-peer overlays to notify users whenevera new update occurs is a promising approach to supportweb based publish subscribe systems like really simple syndication (RSS). Such a peer-to-peer approach can scale well by reducing load at the source and also guarantee timeliness of notifications. Several such overlay based approaches have been proposed in recent years. However, malicious peers may pretend to relay but actually not, and thus deny service, or even propagate counterfeit updates - thus rendering a peer-to-peer mechanism not only useless, but even harmful (e.g., by false updates). We propose overlay independent randomized strategies to mitigate these ill-effects of malicious peers at a marginal overhead, thus enjoying the benefits of peer-to-peer dissemination, along with the assurance of content integrity in RSS like web-based publish-subscribe applications without altering currently deployed server infrastructure.\",\"PeriodicalId\":118263,\"journal\":{\"name\":\"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCGRID.2009.32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCGRID.2009.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

每当有新的更新发生时,使用点对点覆盖通知用户是支持基于web的发布订阅系统(如真正简单的联合(RSS))的一种很有前途的方法。这种点对点方法可以通过减少源端的负载来很好地扩展,并保证通知的及时性。近年来提出了几种基于覆盖的方法。然而,恶意的对等体可能会假装中继,但实际上并没有,从而拒绝服务,甚至传播伪造的更新-从而使点对点机制不仅无用,甚至有害(例如,通过虚假更新)。我们提出了覆盖独立的随机策略,以边际开销减轻恶意对等的这些不良影响,从而享受点对点传播的好处,以及在RSS(如基于web的发布-订阅应用程序)中保证内容完整性,而无需改变当前部署的服务器基础设施。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reliable P2P Feed Delivery
Using peer-to-peer overlays to notify users whenevera new update occurs is a promising approach to supportweb based publish subscribe systems like really simple syndication (RSS). Such a peer-to-peer approach can scale well by reducing load at the source and also guarantee timeliness of notifications. Several such overlay based approaches have been proposed in recent years. However, malicious peers may pretend to relay but actually not, and thus deny service, or even propagate counterfeit updates - thus rendering a peer-to-peer mechanism not only useless, but even harmful (e.g., by false updates). We propose overlay independent randomized strategies to mitigate these ill-effects of malicious peers at a marginal overhead, thus enjoying the benefits of peer-to-peer dissemination, along with the assurance of content integrity in RSS like web-based publish-subscribe applications without altering currently deployed server infrastructure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards Visualization Scalability through Time Intervals and Hierarchical Organization of Monitoring Data Collusion Detection for Grid Computing Resource Information Aggregation in Hierarchical Grid Networks Distributed Indexing for Resource Discovery in P2P Networks Challenges and Opportunities on Parallel/Distributed Programming for Large-scale: From Multi-core to Clouds
×
引用
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