点对点(P2P)覆盖网络中熟人的两种可信赖性

Soichi Sawamura, L. Barolli, A. Aikebaier, Valbona Barolli, M. Takizawa
{"title":"点对点(P2P)覆盖网络中熟人的两种可信赖性","authors":"Soichi Sawamura, L. Barolli, A. Aikebaier, Valbona Barolli, M. Takizawa","doi":"10.1109/BWCCA.2010.90","DOIUrl":null,"url":null,"abstract":"Peer-to-peer(P2P) systems are in nature fully distributed with no centralized coordinator. A peer ps has to collect correct object information from trustworthy acquaintances which are considered to hold correct information. We consider two types of trustworthiness. First, the subjective trustworthiness stst on an acquaintance pt shows how much the peer ps trusts the acquaintance pt. The objective trustworthiness otst on an acquaintance pt indicates how much other peers trust the acquaintance pt. In this paper, we discuss three algorithms OT1, OT2, and OT3 for a peer ps to obtain the objective trustworthiness otst on the acquaintance pt. A peer ps collects subjective trustworthiness on an acquaintance pt from peers and obtain the average value as the objective trustworthiness. In the algorithm OT1, a peer ps tries to find every acquaintance of a target acquaintance pt in a type of flooding algorithm. Here, it takes time and more number of messages are transmitted. On the other hand, the peer ps sends request messages only to the acquaintances to reduce the number of messages in the algorithms OT1 and OT2. In OT2, only acquaintances which the peer ps can trust are considered. We evaluate the algorithms in terms of how correct objective trustworthiness can be obtained.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Two Types of Trustworthiness of Acquaintances in Peer-to-Peer (P2P) Overlay Networks\",\"authors\":\"Soichi Sawamura, L. Barolli, A. Aikebaier, Valbona Barolli, M. Takizawa\",\"doi\":\"10.1109/BWCCA.2010.90\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Peer-to-peer(P2P) systems are in nature fully distributed with no centralized coordinator. A peer ps has to collect correct object information from trustworthy acquaintances which are considered to hold correct information. We consider two types of trustworthiness. First, the subjective trustworthiness stst on an acquaintance pt shows how much the peer ps trusts the acquaintance pt. The objective trustworthiness otst on an acquaintance pt indicates how much other peers trust the acquaintance pt. In this paper, we discuss three algorithms OT1, OT2, and OT3 for a peer ps to obtain the objective trustworthiness otst on the acquaintance pt. A peer ps collects subjective trustworthiness on an acquaintance pt from peers and obtain the average value as the objective trustworthiness. In the algorithm OT1, a peer ps tries to find every acquaintance of a target acquaintance pt in a type of flooding algorithm. Here, it takes time and more number of messages are transmitted. On the other hand, the peer ps sends request messages only to the acquaintances to reduce the number of messages in the algorithms OT1 and OT2. In OT2, only acquaintances which the peer ps can trust are considered. We evaluate the algorithms in terms of how correct objective trustworthiness can be obtained.\",\"PeriodicalId\":196401,\"journal\":{\"name\":\"2010 International Conference on Broadband, Wireless Computing, Communication and Applications\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Broadband, Wireless Computing, Communication and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BWCCA.2010.90\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BWCCA.2010.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

点对点(P2P)系统本质上是完全分布式的,没有集中的协调器。peer ps必须从被认为持有正确信息的可信熟人那里收集正确的对象信息。我们考虑两种类型的可信度。首先,熟人pt上的主观可信度值表示对等体ps对熟人pt的信任程度,熟人pt上的客观可信度值表示其他对等体对熟人pt的信任程度。在本文中,我们讨论了OT1, OT2,和OT3,以获得对熟人pt的客观可信值。peer ps从同伴中收集对熟人pt的主观可信值,并获得平均值作为客观可信值。在OT1算法中,对等体ps试图在一种泛洪算法中找到目标熟人pt的每个熟人。在这里,需要花费时间和更多的消息被传输。另一方面,对等体ps只向熟人发送请求消息,以减少OT1和OT2算法中的消息数。在OT2中,只考虑对等体ps可以信任的熟人。我们根据如何获得正确的客观可信度来评估算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Two Types of Trustworthiness of Acquaintances in Peer-to-Peer (P2P) Overlay Networks
Peer-to-peer(P2P) systems are in nature fully distributed with no centralized coordinator. A peer ps has to collect correct object information from trustworthy acquaintances which are considered to hold correct information. We consider two types of trustworthiness. First, the subjective trustworthiness stst on an acquaintance pt shows how much the peer ps trusts the acquaintance pt. The objective trustworthiness otst on an acquaintance pt indicates how much other peers trust the acquaintance pt. In this paper, we discuss three algorithms OT1, OT2, and OT3 for a peer ps to obtain the objective trustworthiness otst on the acquaintance pt. A peer ps collects subjective trustworthiness on an acquaintance pt from peers and obtain the average value as the objective trustworthiness. In the algorithm OT1, a peer ps tries to find every acquaintance of a target acquaintance pt in a type of flooding algorithm. Here, it takes time and more number of messages are transmitted. On the other hand, the peer ps sends request messages only to the acquaintances to reduce the number of messages in the algorithms OT1 and OT2. In OT2, only acquaintances which the peer ps can trust are considered. We evaluate the algorithms in terms of how correct objective trustworthiness can be obtained.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信