본문 바로가기
KERD
논문KCI 등재

Kad 네트워크에서 게임 이론을 바탕으로 한 인센티브 메커니즘

Incentive Mechanism based on Game Theory in Kad Network

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류컴퓨터학

초록

The Kad network is a peer-to-peer (P2P) network which implements the Kademlia P2P overlay protocol. Nowadays, the Kad network has attracted wide concern as a popular architecture for file sharing systems. Meanwhile, many problems have been coming out in these file sharing systems such as freeriding of users, uploading fake files, spreading viruses, and so on. In order to overcome these problems, we propose an incentive mechanism based on game theory, it establishes a more stable and efficient network environment for Kad users. Users who share valuable resources receive rewards by increasing their credits, while others who supply useless or harmful files are punished. This incentive mechanism in Kad network can be used to detect and prevent malicious behaviors of users and encourage honest interaction among users.

Abstract

The Kad network is a peer-to-peer (P2P) network which implements the Kademlia P2P overlay protocol. Nowadays, the Kad network has attracted wide concern as a popular architecture for file sharing systems. Meanwhile, many problems have been coming out in these file sharing systems such as freeriding of users, uploading fake files, spreading viruses, and so on. In order to overcome these problems, we propose an incentive mechanism based on game theory, it establishes a more stable and efficient network environment for Kad users. Users who share valuable resources receive rewards by increasing their credits, while others who supply useless or harmful files are punished. This incentive mechanism in Kad network can be used to detect and prevent malicious behaviors of users and encourage honest interaction among users.

참고문헌 (24)

  1. P.Maymounkov, "Kademlia:A peer‐to‐peer information system based on the xor metric", Proceedings of IPTPS02, pp.53~65 (2002)
  2. "Napster"[URL]
  3. "Gnutella"[URL]
  4. "KaZaA"[URL]
  5. I.Stoica, "Chord:A Scalable Peer‐to‐peer Lookup Protocol for Internet Applications", Proc.of ACM SIGCOMM, pp.149~160 (2001)
  6. S.Ratnasamy, "A Scalable Content‐Addressable Network", Proc.of ACM SIGCOMM, pp.161~172 (2001)
  7. A.Rowstron, "Pastry:Scalable,distributed object location and routing for large‐scale peer‐to‐peer systems", Proc.IFIP, 2001, 329~350
  8. M.Feldman, "Freeriding and whitewashing in peer‐to‐peer systems", Proc.ACM SIGCOMM Workshop on Practice and Theory of Incentives in Networked Systems, pp.228~236 (2004)
  9. E.Adar, "Free riding on Gnutella", SSL-00–63,Xerox PARC, ~ (2000)
  10. D. Fudenberg, "Game Theory" (1991), MIT press
  11. S.D.Kamvar, "The EigenTrust Algorithm for Reputation Management in P2P Networks", Proc.of 12th International Conference on World Wide Web(WWW 2003), pp.640~651 (2003)
  12. L. Xiong, "PeerTrust:Supporting Reputation‐Based Trust for Peer‐to Electronic Communities", IEEE Transactions on Knowledge and Data Engineering, 16(7), pp.843~857 (2004)
  13. R.Zhou, "PowerTrust:A robust and scalable reputation system for trusted peer‐to‐peer computing", Parallel and Distributed Systems,IEEE Transactions on, 18(4), pp.460~473 (2007)
  14. O.Kwon, "FileTrust:Reputation Management for Reliable Resource Sharingin Structured Peer‐to‐Peer Networks", IEICE Transactions on Communication, E90-B(4), pp.826~835 (2007)
  15. R.Zhou, "GossipTrust for Fast Reputation Aggregation in P2P Networks", IEEE Trans.Knowledge and Data Eng., 20(9), pp.1282~1295 (2008)
  16. A.Singh, "TrustMe:Anonymous Management of Trust Relationships in Decentralized P2P Systems", IEEE Intl.Conf.on Peer‐to Peer Computing, pp.142~149 (2003)
  17. P.Golle, "Incentives for sharing inP2P networks", In 3rd ACM Conf.on Electronic Commerce, pp.264~267 (2001)
  18. C.Buragohain, "A game theoretic framework for incentives in p2p systems", In Proc.of the 3rd Int.Conference on P2P Computing, 통권 : 48 (2003)
  19. M. Feldman, "Robust incentive techniques for peer‐to‐peer networks", In ACM EC’04, pp.102~111 (2004)
  20. R. Gupta, "Game theory as a tool to strategize as well as predict nodes behavior in peer‐to‐peer networks", Parallel and Distributed Systems, International Conference on, pp.244~249 (2005)
  21. T.B. Ma, "A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks", In ACM Sigmetrics’04, pp.189~198 (2004)
  22. T.B.Ma, "An Incentive Mechanism for P2P Networks", In IEEE ICDCS, pp.516~523 (2004)
  23. T.B.Ma, "Incentive and Service Differentiation in P2P Networks:A Game Theoretic Approach", IEEE, 2006, pp.14(5), 978~991
  24. "Oversim"[URL]

관련 논문AI추천

이 간행물의 다른 논문 (9건)