Resource Competition And Allocation Mechanism In P2P Environment

In recent years, with the development of the expanding system scale and more widely application, P2P network has been grow rapidly. P2P network breaks the traditional C/S mode, and peers with the dual client and server features have the equal status. In the open, dynamic P2P network environment, each peer can join and exit the system freely. Because peers’ computing and storage capacity are limited, sometimes they need to request other peers’ unutilized resources to complete their tasks. And each peer in the P2P network with the characteristic of selfishness and independence, therefore, making the sharing of resources and cooperation among peers becomes very difficult. So, devising an efficient resources allocation mechanism is a very urgent and important problem.This paper reviews to co relational research about the P2P network in the resource allocation problems, and then lists some of existing solutions to the problem, summed up the advantages and disadvantages of these different methods. We propose kinds of resource allocation schemes of in different P2P network environments on the base of existing solutions.To motive autonomous peers share their resources, devising an effective resource allocation strategies to prevent some peers damaging the P2P system, Firstly, in this paper, we present a bidding-based approach for resource allocation to address these issues. We investigate peers’ bidding strategies under different scenarios in terms of probability distributions that peers’ valuations of their prioritized tasks follow, and derive the symmetric Nash equilibrium solutions. We also explore possible three kinds of malicious behavior, and present several statistical mechanisms for detecting out the malicious peers from the noisy environments respectively.Secondly, this paper proposes a joint of bidding and reputation mechanism, and combined with the game theory approach to allocate the resources in the P2P network. In this mechanism, each node in the form of non-cooperative game competition, according to information provided by service peer, with the current resources of its own reputation and demand conditions, through the way of iteration, each peer can have a Nash equilibrium strategy of price and making its benefit maximum. The mechanism we proposed has the feature of confidentiality, and peers do not need to open their own private information, only a small amount based on information provided by the service peer can eventually reach Nash equilibrium.Finally, in the mobile P2P network, peers with limited resources, sometimes through the base station to download the requested content from the network server. In order to reduce the cost of consumption of the peer, then the cooperation among peer group becomes very important. In light of this, we consider the download and time cost of peer group to develop the appropriate algorithm to get optimal download strategy. In aspect of timing, we focused on two common ways to measure it:the maximum dissemination time and the average dissemination time of the peer group. We analyze how to make the peer group to minimize the maximum dissemination time and average dissemination time is minimized theoretically when content is disseminating among peers.In summary, we have demonstrated the feasibility and effectiveness of the proposed algorithm in the theory and simulation experiment.