A Node-centric P2P Resource Scheduling Algorithms Based On The Idea Of VLAN

In recent years,P2P(peer-to-peer) technology research and become the focus of attention to Napster,Gnutella,BT,MSN,pplive,represented by the increasing popularity of P2P applications. Information sharing is one of its most common applications.Sharing in P2P systems,each Peer node can contribute to local resources with other nodes to share,but also get from other nodes accessing to resources,both in the network to provide resources to act as a server and as client access to resources.Current P2P information retrieval, transmission control mechanisms of the various deficiencies exist:Search node with blindness, that is,there is likely to continue to try to cross a lot of routing and high cost of their own communication node of the exchange of information;the backbone of the existence of a large number of invalid network link,resulting in a constant on the one hand,network bandwidth swallow,particularly valuable are the backbone of network bandwidth,bandwidth utilization on the other hand,is very low.In this paper,a node-centric P2P resource scheduling algorithms based on the idea of VLAN is bring forward.By this way,we effectively reduce the coverage costs brought by the dynamic network,and reduce trash data in the network,improve the network(especially backbone) of the bandwidth utilization.Also proved the correctness of the algorithm and obtained the highest utilization rate of resources at the time of the radius of the virtual LAN.Finally,through simulation the effectiveness of this algorithm is validated.