南京邮电大学学报（自然科学版）2017，Vol.37Issue(2)：74-79,6.DOI:10.14132/j.cnki.1673-5439.2017.02.012
基于马尔科夫链的非结构化P2P网络信誉模型
Reputation estimation model for unstructured P2P network based on Markov chain
贺超凯 1吴蒙2
作者信息
- 1. 南京邮电大学计算机学院,江苏南京210023
- 2. 南京邮电大学研究生院,江苏南京210003
- 折叠
摘要
Abstract
Building trust relationships between peers is an important and difficult problem for security needs of P2P network without a central server.P2P reputation model is introduced by collecting the generated peer feedbacks and aggregating them to yield global reputation scores.Most P2P applications in the Internet are unstructured,without fast hashing and searching mechanisms,how to perform efficient reputation estimation is a major challenge on unstructured P2P computing.This paper proposes a two-step reputation estimation approach for the unstructured P2P network.Firstly,a Markov chain model is proposed to determine the reputation value for each one-hop neighbors.A peer's reputation value is analyzed from its previous trust manner in this group.The proposed trust model is proven as an ergodic continuous-time Markov chain model.Secondly,a peer with the highest RV of a group is selected as the central authentication server,the peer with the second highest reputation value is selected as the backup group leader taking over central authentication server when the older server fails.The procedures of the peer's reputation value are detailed.Numerical results indicate that the analytical reputation value of each peer is very close to that of simulation under various situations.关键词
离散马尔科夫链/信誉计算/非结构化P2P网络Key words
discrete Markov chain/reputation estimation/unstructured P2P network分类
信息技术与安全科学引用本文复制引用
贺超凯,吴蒙..基于马尔科夫链的非结构化P2P网络信誉模型[J].南京邮电大学学报（自然科学版）,2017,37(2):74-79,6.
