基于点对点覆盖网络访问控制的对等体可信度

Kenichi Watanabe, Y. Nakajima, Naohiro Hayashibara, T. Enokido, M. Takizawa, S. Deen
{"title":"基于点对点覆盖网络访问控制的对等体可信度","authors":"Kenichi Watanabe, Y. Nakajima, Naohiro Hayashibara, T. Enokido, M. Takizawa, S. Deen","doi":"10.1109/ICDCSW.2006.112","DOIUrl":null,"url":null,"abstract":"Service supported by an object in a peer-to-peer (P2P) overlay network is modeled to be a set of methods and quality of service (QoS). In addition to discovering a peer holding a target object, it is critical to discuss what peer is allowed to manipulate the target object in what method. In this paper, we take an acquaintance approach to finding and manipulating objects in P2P overlay networks. An acquaintance peer of a peer is a peer whose service the peer knows and with which the peer can directly communicate In this paper, we discuss ways to obtain results satisfying an access request by the cooperation of acquaintances. Acquaintance peers of a peer p may hold different information on target peers since it takes time to propagate change information of the target peers, and peers may be faulty. Here, it is critical to discuss how much a peer can trust each acquaintance. First, we define how much a requesting peer is satisfied for each access request issued to an acquaintance. Then, we define the trustworthiness of an acquaintance based on the satisfiability.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Trustworthiness of Peers Based on Access Control in Peer-to-Peer Overlay Networks\",\"authors\":\"Kenichi Watanabe, Y. Nakajima, Naohiro Hayashibara, T. Enokido, M. Takizawa, S. Deen\",\"doi\":\"10.1109/ICDCSW.2006.112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Service supported by an object in a peer-to-peer (P2P) overlay network is modeled to be a set of methods and quality of service (QoS). In addition to discovering a peer holding a target object, it is critical to discuss what peer is allowed to manipulate the target object in what method. In this paper, we take an acquaintance approach to finding and manipulating objects in P2P overlay networks. An acquaintance peer of a peer is a peer whose service the peer knows and with which the peer can directly communicate In this paper, we discuss ways to obtain results satisfying an access request by the cooperation of acquaintances. Acquaintance peers of a peer p may hold different information on target peers since it takes time to propagate change information of the target peers, and peers may be faulty. Here, it is critical to discuss how much a peer can trust each acquaintance. First, we define how much a requesting peer is satisfied for each access request issued to an acquaintance. Then, we define the trustworthiness of an acquaintance based on the satisfiability.\",\"PeriodicalId\":333505,\"journal\":{\"name\":\"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCSW.2006.112\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCSW.2006.112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在P2P (peer-to-peer)覆盖网络中,对象支持的服务被建模为一组方法和服务质量(QoS)。除了发现持有目标对象的对等体之外,讨论允许哪个对等体以何种方法操作目标对象也很重要。在本文中,我们采用一种熟悉的方法来寻找和操作P2P覆盖网络中的对象。一个对等体的熟人对等体是一个对等体知道其服务并且可以直接与之通信的对等体。本文讨论了如何通过熟人之间的合作来获得满足访问请求的结果。由于传播目标对等体的变化信息需要一定的时间,并且对等体可能出现故障,因此,对等体p的熟人对等体可能持有与目标对等体不同的信息。在这里,讨论一个同伴可以在多大程度上信任每个熟人是至关重要的。首先,我们定义向熟人发出的每个访问请求对请求对等端的满足程度。然后,我们基于满意度定义了熟人的可信度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Trustworthiness of Peers Based on Access Control in Peer-to-Peer Overlay Networks
Service supported by an object in a peer-to-peer (P2P) overlay network is modeled to be a set of methods and quality of service (QoS). In addition to discovering a peer holding a target object, it is critical to discuss what peer is allowed to manipulate the target object in what method. In this paper, we take an acquaintance approach to finding and manipulating objects in P2P overlay networks. An acquaintance peer of a peer is a peer whose service the peer knows and with which the peer can directly communicate In this paper, we discuss ways to obtain results satisfying an access request by the cooperation of acquaintances. Acquaintance peers of a peer p may hold different information on target peers since it takes time to propagate change information of the target peers, and peers may be faulty. Here, it is critical to discuss how much a peer can trust each acquaintance. First, we define how much a requesting peer is satisfied for each access request issued to an acquaintance. Then, we define the trustworthiness of an acquaintance based on the satisfiability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信