• DocumentCode
    2759556
  • Title

    A Distributed and Monitoring-Based Mechanism for Discouraging Free Riding in P2P Network

  • Author

    Junfeng, Tian ; Lidan, Yang ; Juan, Li ; Zhongyu, Liu

  • Author_Institution
    Network Technol. Inst., Hebei Univ., Baoding, China
  • fYear
    2009
  • fDate
    15-20 Nov. 2009
  • Firstpage
    379
  • Lastpage
    384
  • Abstract
    With the rapid development of P2P network, free riding has become a serious problem. Controlling free riding is a hot research both in academic and industrial communities. In this paper, a Distributed and Monitoring-based Mechanism (DMM) is proposed to discourage free riding in P2P network. Based on the behavior and function of nodes in the network, the paper makes the network system abstractly as a distributed and monitoring structure focus on avoiding malignant cheating and dishonest behaviors. Through analyzing kinds of factors that effect the nodes´ contribution to the whole network, a utility function is defined to determine the useful degree of the nodes and make corresponding treatments to the nodes´ service request. Moreover, we introduce reputation to guarantee the QoS and import license to realize the rewards and punishment with nodes in the network. Finally, the effectiveness and feasibility of the model is illustrated by the simulation experiment designed with PeerSim.
  • Keywords
    peer-to-peer computing; P2P network; PeerSim model; distributed based mechanism; free riding control; monitoring based mechanism; utility function; Cancer; Computer networks; Distributed computing; Electrical equipment industry; Game theory; Licenses; Monitoring; Peer to peer computing; Quality of service; Robustness; Free Riding; License; P2P network; Reputation; Utility Function;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2009. COMPUTATIONWORLD '09. Computation World:
  • Conference_Location
    Athens
  • Print_ISBN
    978-1-4244-5166-1
  • Electronic_ISBN
    978-0-7695-3862-4
  • Type

    conf

  • DOI
    10.1109/ComputationWorld.2009.54
  • Filename
    5359615