Journal of the Korea Institute of Information Security & Cryptology (정보보호학회논문지)

Korea Institute of Information Security and Cryptology (한국정보보호학회)
권호 표지
DOI QR코드

DOI QR Code

Incentive Mechanism based on Game Theory in Kad Network

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

  • Wang, Xu (Information Security Research Laboratory INHA University) ;
  • Ni, Yongqing (Information Security Research Laboratory INHA University) ;
  • Nyang, Dae-Hun (Information Security Research Laboratory INHA University)
  • 왕서 (인하대학교 정보보호연구실) ;
  • 니영청 (인하대학교 정보보호연구실) ;
  • 양대헌 (인하대학교 정보보호연구실)
  • Received : 2009.11.26
  • Accepted : 2010.05.11
  • Published : 2010.06.30
Download PDF
⟨ Previous Next ⟩

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.

Kad 네트워크는 파일 공유 시스템 중 가장 널리 알려진 네트워크이다. 파일 공유 시스템은 사용자의 일방적 파일 다운로드 받기, 가짜파일 업로드하기, 바이러스 배포하기 등에 사용되는 등의 문제를 가지고 있고, 이러한 문제점을 극복하기 위하여, 이 논문에서는 게임 이론을 바탕으로 하는 인텐티브 메커니즘을 제안한다. 이 메커니즘은 Kad 사용자를 위하여 보다 안정적이고 효율적인 네트워크 환경을 만들어 준다. 즉, 쓸모 없고 위험한 파일 등을 제공하는 다른 사용자들이 처벌받는 것에 반하여, 가치 있는 리소스를 공유한 사용자는 신용이 증가하는 대가를 받는다. Kad 네트워크에서 이 인센티브 메커니즘은 사용자의 악의적인 행동을 찾거나 방지하고 사용자들 사이에서의 정직한 통신을 장려하는데 도움을 준다.

Keywords

Acknowledgement

Supported by : 인하대학교

References

  1. P. Maymounkov and D. Mazieres, "Kademlia: A peer‐to‐peer information system based on the xor metric," In Proceedings of IPTPS02, Cambridge, USA, pp. 53-65, Mar. 2002.
  2. Napster, http://www.napster.com/
  3. Gnutella, http://gnutella.wego.com/
  4. KaZaA, http://www.kazaa.com/
  5. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer to peer Lookup Protocol for Internet Applications," in Proc. of ACM SIGCOMM, pp. 149-160, Aug. 2001.
  6. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content‐Addressable Network," in Proc. of ACM SIGCOMM, pp. 161-172, Aug. 2001.
  7. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large‐scale peer to peer systems," in Proc. IFIP/ACM Middleware 2001, Heidelberg, Germany, pp. 329-350, Nov. 2001.
  8. M. Feldman, C. Papadimitriou, J. Chuang, and I. Stoica, "Freeriding and whitewashing in peer to peer systems," Proc. ACM SIGCOMM Workshop on Practice and Theory of Incentives in Networked Systems, pp. 228-236, Aug. 2004.
  9. E. Adar and B. Huberman, "Free riding on Gnutella," SSL-00-63, Xerox PARC, Aug. 2000.
  10. D. Fudenberg and J. Tirole, Game Theory, MIT press, Oct. 1991.
  11. S.D. Kamvar, M.T. Schlosser, and H. Garcia-Molina, "The EigenTrust Algorithm for Reputation Management in P2P Networks," In Proc. of 12th International Conference on World Wide Web (WWW 2003), Budapest, Hungary, pp. 640-651, May. 2003.
  12. L. Xiong and L. Liu, "PeerTrust:Supporting Reputation‐Based Trust for Peer to Electronic Communities," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 7, pp. 843-857, July 2004. https://doi.org/10.1109/TKDE.2004.1318566
  13. R. Zhou and K. Hwang, "PowerTrust: A robust and scalable reputation system for trusted peer to peer computing," Parallel and Distributed Systems, IEEE Transactions on, vol. 18, no. 4, pp. 460-473, Apr. 2007. https://doi.org/10.1109/TPDS.2007.1021
  14. O. Kwon, S. Lee, and J. Kim, "File-Trust:Reputation Management for Reliable Resource Sharingin Structured Peer to Peer Networks," IEICE Transactions on Communication, vol. E90-B, no. 4, pp. 826-835, Apr. 2007. https://doi.org/10.1093/ietcom/e90-b.4.826
  15. R. Zhou and K. Hwang, "GossipTrust for Fast Reputation Aggregation in P2P Networks," IEEE Trans. Knowledge and Data Eng., vol. 20, no. 9, pp. 1282-1295, Sep. 2008. https://doi.org/10.1109/TKDE.2008.48
  16. A. Singh and L. Liu, "TrustMe: Anonymous Management of Trust Relationships in Decentralized P2P Systems," IEEE Intl. Conf. on Peer to Peer Computing, pp. 142-149, Sep. 2003.
  17. P. Golle, K.L.‐Brown, and I. Mironov, "Incentives for sharing inP2P networks," In 3rd ACM Conf. on Electronic Commerce, pp. 264-267, Oct. 2001.
  18. C. Buragohain, D. Agrawal, and S. Suri, "A game theoretic framework for incentives in p2p systems," In Proc. of the 3rd Int. Conference on P2P Computing, p. 48, Sep. 2003.
  19. M. Feldman, K. Lai, I. Stoica, and J. Chuang, "Robust incentive techniques for peer‐to‐peer networks," In ACM EC'04, pp. 102-111, May 2004.
  20. R. Gupta and A.K. Somani, "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, July 2005.
  21. T.B. Ma, C.M. Lee, J.C.S. Lui, and K.Y. Yau, "A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks," In ACM Sigmetrics'04, pp. 189-198, June 2004.
  22. T.B. Ma, C.M. Lee, J.C.S. Lui, and K.Y. Yau, "An Incentive Mechanism for P2P Networks," In IEEE ICDCS, pp.516-523, Mar. 2004.
  23. T.B. Ma, C.M. Lee, J.C.S. Lui, and K.Y. Yau, "Incentive and Service Differentiation in P2P Networks: A Game Theoretic Approach," IEEE/ACM Trans. on Networking, vol. 14, no. 5, pp. 978-991, Oct. 2006. https://doi.org/10.1109/TNET.2006.882904
  24. Oversim, http://www.oversim.org/