非構造化P2Pネットワークにおける評価偽造の影響低減を目的とした評価集約手法

全文

(1)P2P. 1,a). 1,b). 1,c). P2P GossipTrust power node. GossipTrust. power node power node DIF-Trust. power node power node. DIF-Trust. GossipTrust. 1.. power node P2P. power node. 1. P2P. [6][8] , [1][2][3]. P2P (. ). GossipTrust. power node [4][5]. P2P power node power node DIF-Trust DIF-Trust [7][8][9]. P2P GossipTrust. [10]. power node. power node 1 [7][8] GossipTrust. power node GossipTrust 2 3. 1. a) b) c). DIF-Trust. 4 Graduate School of Science and Technology, Keio University [email protected] [email protected] [email protected]. 5.

(2) 2.3 GossipTrust. 2.. P2P GossipTrust. GossipTrust. GossipTrust 2.1 P2P. GossipTrust. power node. power node power node GossipTrust. power node power node power node. i. j. t. rij (t) 2.2. sij (t). 1. rij (t) sij (t) = !n , (0 ≤ sij (t) ≤ 1) j=1 rij (t). i = 1, 2, · · · , n.. sij (t). !n. j=1 sij (t). (1). =1. i. xij. xij (t) = ((1 − α) sij (t) + αspj (t)) × vi (t − 1) spj (t). power node p α t−1. (2). j. power node i. 2. j. 2. t. j. vi (t − 1) i. xij (t) spj (t). power node α. 1. 1.

(3) DIF-Trust (Decreasing the Influence of Forgery) DIF-Trust. power node. DIF-Trust power node power node power node power node. 1 GossipTrust. DIF-Trust. GossipTrust DIF-Trust. • • •. 3.1 power node GossipTrust. 1. 1 power node. GossipTrust power node θij. power node. i. j. power node θij (t) = β × |sij (t) − spj (t)| .. 3. 3. (3). i sij (t). j. power node. j. spj (t). β β( 0 ≤ sij ≤ 1 ). θij. GossipTrust power node. power node power node ψ. power node. spj (t). power node. power node ψ. power node. spj (t) power node power node. 3.. power P2P power node power node. node 2 ψ.

(4) ψ power node. DIF-Trust. ψi (t) = siH (t) − siL (t) siH (t) =. Hnum !. (4). sihk (t)/Hnum. (5). k=1. siL (t) =. Lnum !. silk (t)/Lnum. 2 DIF-Trust. (6). k=1. 4. 3.3. Hnum Lnum. i. power node. sihk (t). hk. silk (t). i. power node. lk siH (t). i siL (t). i power node. i power ψ(t). i. node i. power node. p. t 3.2 rip (t) = rip (t − 1) × η 8. 1. (8) i. rip (t − 1) 2 power node. η(0≤η≤1). DIF-Trust. spj (t) power node power 2. node. 8. 2 power node power node. spj (t) power node. xij (t) = sij (t) × vi (t − 1) 7. (7). i. sij (t) i. vi (t − 1). 4. DIF-Trust.

(5) 1 N. 1000. γ γf : γm 1. 1: 9 F. power node. 100. Np. power node. 5. 0 50. 0.1 α. 5. 0.3. β. 0.5 η. 0.5. ′. rij (t) = 1 − rij (t). 100. (9). ′. 9. rij (t) 3 4 3 n1. n7. n8. n10. power node 4 n1, n2 n7. n8. n10. 3. power node. • • • •. 4. (. ). 4.1 1 1000. P2P 4.2 100 1. 5 100. GossipTrust 5. GossipTrust. 2 power node power node power node.

(6) 5 GossipTrust. 6 GossipTrust. power node. 4.3 6. 7. GossipTrust. 7 DIF-Trust. DIF-Trust 6. 2 4 GossipTrust power node 2. 10. power node. power node power node. 6. DIF-Trust power node. 4 7. 2. 4.4. 3. 8. 9. GossipTrust. Trust 10. DIF8. 9 11 DIF-Trust. power node. 8. DIF-Trust. GossipTrust 3. 20 DIF-Trust power node. 3 power node. 9 power node.

(7) 8. 10. GossipTrust DIF-Trust. DIF-Trust GossipTrust 9. 5. power node. power node. DIF-Trust. power GossipTrust. node DIF-Trust. 9. DIF-Trust. DIF-Trust 80. power node power node GossipTrust. power node power node. DIF-Trust. power node. GossipTrust. 4.5 10. GossipTrust. DIF-Trust 23. 10. DIF-Trust. 80.

(8) [1]. [2]. [3] [4]. [5]. [6]. [7]. [8]. [9]. [10]. J. Erman, A. Mahanti, M. Arlitt, and C. Williamson, “Identifying and discriminating between web and peerto-peer traffic in the network core,” 16th international conference on World Wide Web ACM New York, NY, USA, May 2007. M. Hefeeda and O. Saleh, “Traffic modeling and proportional partial caching for peer-to-peer systems,” IEEE/ACM TON archive Volume 16 Issue 6 2008, Dec 2008. J. Meserve, ”P2P traffic still dominates the Net,” Network World, Aug 2005. N. Christin, A. Weigend, and J. Chuang, ”Content availability, pollution and poisoning in file sharing peer-topeer networks,” ACM Conf. on E-Commerce 2005, Jun 2005. J. Mao, Y. Cui, j. Huang, and J. Zhang, ”Modeling and Analysis of Resource’s Load-Scale in P2P Network,” CMC 2009, Jan 2009. R. Zhou, and K. Hwang, ”PowerTrust: A Robust and Scalable Reputation System for Trusted P2P Computing”, IEEE Trans. on Parallel and Distributed Systems, pp.460-473, April 2007. R. Zhou and K. Hwang, ”Gossip-based reputation aggregation for unstructured peer-to-peer networks,” IEEE International. on Parallel and Distributed Processing Symposium, Mar 2007. R. Zhou, K. Hwang, and M. Cai, ”GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks,” IEEE Trans. on Knowledge and Data Engineering, vol. 20, Issue. 9, pp. 1282-1295, 2008. Yajima, T.; Matsumoto, A.; Shigeno, H., ”PTrust: Provisional Value based trust for reputation aggregation in peer-to-peer networks,” 1st International Symposium on Access Spaces (IEEE-ISAS 2011), pp. 180-185, June 2011. Takeda, S.; Ushikubo, H.; Shigeno, H., ”SPTrust: Reputation Aggregation Method Based on Similarity to Reputation Scores of Power Nodes in Unstructured P2P Networks,” Eighth Inter National Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA2013), October 2013..

(9)