Q-Feed-An Effective Solution for the Free-Riding Problem in Unstructured P2P Networks

被引：1
|
作者：
Thampi, Sabu M. [1 ]
Sekaran, Chandra K. [2 ]
机构：
[1] LBS Inst Technol Women, Dept Comp Sci & Engn, Trivandrum 695012, Kerala, India
[2] Natl Inst Technol Karnataka, Dept Comp Engn, Surathkal 575025, Karnataka, India
来源：
INTERNATIONAL JOURNAL OF DIGITAL MULTIMEDIA BROADCASTING | 2010年 / 2010卷
关键词：
D O I：
10.1155/2010/793591
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
This paper presents a solution for reducing the ill effects of free-riders in decentralised unstructured P2P networks. An autonomous replication scheme is proposed to improve the availability and enhance system performance. Q-learning is widely employed in different situations to improve the accuracy in decision making by each peer. Based on the performance of neighbours of a peer, every neighbour is awarded different levels of ranks. At the same time a low-performing node is allowed to improve its rank in different ways. Simulation results show that Q-learning-based free riding controlmechanism effectively limits the services received by free-riders and also encourages the low-performing neighbours to improve their position. The popular files are autonomously replicated to nodes possessing required parameters. Due to this improvement of quantity of popular files, free riders are given opportunity to lift their position for active participation in the network for sharing files. Q-feed effectively manages queries from free riders and reduces network traffic significantly.
引用
收藏
页数：14
相关论文
共 50 条
  • [1] ARA: A robust audit to prevent free-riding in P2P networks
    Ham, MJ
    Agha, G
    FIFTH IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2005, : 125 - 132
  • [2] The Orchard algorithm: P2P multicasting without free-riding
    Mol, J. J. D.
    Epema, D. H. J.
    Sips, H. J.
    SIXTH IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2006, : 275 - +
  • [3] Enhancing Tit-for-Tat Strategy to Cope with Free-Riding in Unreliable P2P Networks
    Peng, Dongsheng
    Liu, Weidong
    Lin, Chuang
    Chen, Zhen
    Peng, Xuehai
    2008 3RD INTERNATIONAL CONFERENCE ON INTERNET AND WEB APPLICATIONS AND SERVICES (ICIW 2008), 2008, : 336 - 341
  • [4] Adopting game theory to inhibit free-riding in P2P network
    Huo, Ying
    Journal of Computational Information Systems, 2011, 7 (02): : 645 - 653
  • [5] Game theoretic analyses for free-riding and whitewashing in P2P systems
    Ouyang Jingcheng
    Lin Yaping
    Zhou Siwang
    7TH INTERNATIONAL SYMPOSIUM ON INSTRUMENTATION AND CONTROL TECHNOLOGY: MEASUREMENT THEORY AND SYSTEMS AND AERONAUTICAL EQUIPMENT, 2008, 7128
  • [6] Free-riding, Fairness, and Firewalls in P2P File-Sharing
    Mol, J. J. D.
    Pouwelse, J. A.
    Epema, D. H. J.
    Sips, H. J.
    P2P'08: EIGHTH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2008, : 301 - 310
  • [7] An Effective Search Technique in Unstructured P2P Networks
    Xu, Baomin
    Li, Chunyan
    Ma, Hongyan
    2009 1ST IEEE SYMPOSIUM ON WEB SOCIETY, PROCEEDINGS, 2009, : 47 - +
  • [8] Cooperating with free riders in unstructured P2P networks
    Joung, Yuh-Jzer
    Chiu, Terry Hui-Ye
    Chen, Shy-Min
    COMPUTER NETWORKS, 2012, 56 (01) : 198 - 212
  • [9] A Point-Based Inventive System to Prevent Free-Riding on P2P Network Environments
    Moon, Jongbae
    Cho, Yongyun
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2011, PT IV, 2011, 6785 : 462 - 471
  • [10] An empirical study of free-riding behavior in the maze P2P file-sharing system
    Yang, M
    Zhang, Z
    Li, XM
    Dai, YF
    PEER-TO-PEER SYSTEMS IV, 2005, 3640 : 182 - 192
12345