可信八卦:一种点对点信息共享的抗谣言传播机制

21st International Conference on Advanced Information Networking and Applications (AINA '07) Pub Date : 2007-05-21 DOI:10.1109/AINA.2007.140

Arindam Mitra, Muthucumaru Maheswaran

{"title":"可信八卦:一种点对点信息共享的抗谣言传播机制","authors":"Arindam Mitra, Muthucumaru Maheswaran","doi":"10.1109/AINA.2007.140","DOIUrl":null,"url":null,"abstract":"Epidemic protocols such as gossip have proven to have many desirable properties for information sharing. However, trust is one of the issues that is yet to be examined with respect to these protocols. In this paper, we present a trusted gossip protocol that uses trust estimates to impede spreading of rumors with reasonable message and processing overheads. We use traces collected from known social networks to estimate the performance of trusted gossip.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Trusted Gossip:A Rumor Resistant Dissemination Mechanism for Peer-to-Peer Information Sharing\",\"authors\":\"Arindam Mitra, Muthucumaru Maheswaran\",\"doi\":\"10.1109/AINA.2007.140\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Epidemic protocols such as gossip have proven to have many desirable properties for information sharing. However, trust is one of the issues that is yet to be examined with respect to these protocols. In this paper, we present a trusted gossip protocol that uses trust estimates to impede spreading of rumors with reasonable message and processing overheads. We use traces collected from known social networks to estimate the performance of trusted gossip.\",\"PeriodicalId\":361109,\"journal\":{\"name\":\"21st International Conference on Advanced Information Networking and Applications (AINA '07)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"21st International Conference on Advanced Information Networking and Applications (AINA '07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2007.140\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2007.140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

诸如八卦之类的流行病协议已被证明具有许多理想的信息共享特性。但是，信任是这些议定书有待审查的问题之一。在本文中，我们提出了一个可信的八卦协议，该协议使用信任估计来阻止谣言的传播，并具有合理的消息和处理开销。我们使用从已知社交网络收集的痕迹来估计可信八卦的表现。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Trusted Gossip:A Rumor Resistant Dissemination Mechanism for Peer-to-Peer Information Sharing

Epidemic protocols such as gossip have proven to have many desirable properties for information sharing. However, trust is one of the issues that is yet to be examined with respect to these protocols. In this paper, we present a trusted gossip protocol that uses trust estimates to impede spreading of rumors with reasonable message and processing overheads. We use traces collected from known social networks to estimate the performance of trusted gossip.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

21st International Conference on Advanced Information Networking and Applications (AINA '07)

自引率

0.00%

发文量