Trustworthiness of Acquaintances Based on Access Control in Peer-to-Peer Overlay Networks

• Item type: Symposium(1)
• 公開日: 2006-11-23
• タイトル: Trustworthiness of Acquaintances Based on Access Control in Peer-to-Peer Overlay Networks
• タイトル / 言語: en
• タイトル: Trustworthiness of Acquaintances Based on Access Control in Peer-to-Peer Overlay Networks
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: マルチメディア通信と分散処理ワークショップ
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_5794
• 資源タイプ: conference paper
• その他タイトル / その他のタイトル: セッション1
• 著者所属: Tokyo Denki University
• 著者所属: Rissho University
• 著者所属(英): en
• 著者所属(英): Tokyo Denki University
• 著者所属(英): en
• 著者所属(英): Rissho University
• 著者名: Yoshio, Nakajima; Kenichi, Watanabe; Valbona, Leonald; Naohiro, Hayashibara; Tomoya, Enokido; Makoto, Takizawa
• 著者名(英): Yoshio, Nakajima; Kenichi, Watanabe; Valbona, Leonald; Naohiro, Hayashibara; Tomoya, Enokido; Makoto, Takizawa
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Objects are distributed to peers in a P2P overlay network. Service supported by an object is modeled to be a set of methods and QoS. An acquaintance peer of a peer P is a peer about whose service the peer p knows and with which P can directly communicate. We define how satisfiable a requesting peer is for access requests by taking into account the authorization. Acquaintance peers of a peer P may hold inconsistent information on target peers since it takes time to propagate change information of the target peers and peers may be faulty. Hence，it is critical to discuss how much a peer can trust each acquaintance. We define the trustworthiness of each acquaintance by aggregating the satisfiability which is obtained through each interaction with the acquaintance. Each time a peer gets a new acquaintance and acquaintance information is changed，each peer keeps it in record. Due to the limited size of memory，the peer throws away information of less trustworthy acquaintances to make a space to store new acquaintance information. The trustworthiness of acquaintance of each peer is propagated in a peer-by-peer way while some acquaintance information is recorded in a peer. We evaluate how the trustworthiness of acquaintance is changing through interactions among peers.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Objects are distributed to peers in a P2P overlay network. Service supported by an object is modeled to be a set of methods and QoS. An acquaintance peer of a peer P is a peer about whose service the peer p knows and with which P can directly communicate. We define how satisfiable a requesting peer is for access requests by taking into account the authorization. Acquaintance peers of a peer P may hold inconsistent information on target peers since it takes time to propagate change information of the target peers and peers may be faulty. Hence，it is critical to discuss how much a peer can trust each acquaintance. We define the trustworthiness of each acquaintance by aggregating the satisfiability which is obtained through each interaction with the acquaintance. Each time a peer gets a new acquaintance and acquaintance information is changed，each peer keeps it in record. Due to the limited size of memory，the peer throws away information of less trustworthy acquaintances to make a space to store new acquaintance information. The trustworthiness of acquaintance of each peer is propagated in a peer-by-peer way while some acquaintance information is recorded in a peer. We evaluate how the trustworthiness of acquaintance is changing through interactions among peers.
• 書誌情報: マルチメディア通信と分散処理ワークショップ論文集; 巻 2006, 号 15, p. 7-12, 発行日 2006-11-23
• 出版者 / 言語: ja
• 出版者: 情報処理学会