An Efficient Virtual Co-Allocation Service Model in P2P Networks

In the realistic networks, resources are mainly concentrated in several important nodes, with a large number of nodes acting as the request of the service. Because P2P network is a virtual network based on application layer of the Internet, and free riding, under the wide area network environment, where unavoidably exist some problems such as congestion, node failure, low efficiency and quality of service （QoS）. In order to solve these problems, a scheme is provided, which dynamically constructs virtual co-allocation service pool that consists of service member coordination to achieve the load balance. A stakeholder-centric virtual organization model is put forward to cope with the problem of how to dynamically select autonomous partners services and processes to form a virtual organization to satisfy the stakeholders requirement in realistic networks. The scheme constructs the strategy of choosing the service member coordination based on D-S（Dempster-Shafer） evidence reasoning. It makes use of the historical trade information of nodes and recommendation certificate to show the spare service alliances global trust character. Also provided are the virtual co-allocation service pool of mathematics model, constraint condition, constructional rule, and correlative analysis. The simulation results show that the scheme could effectively solve the above problems, and greatly improves the QoS of P2P network.