Rearch On Load Balance Scheme In Structured P2P System

P2P is recent a very popular application. The peer-to-peer structure allows peers to be not only service requester but also service provider. P2P can be classified in two categories, structured P2P and unstructured P2P. In the field of structured P2P, load always be distributed unbalanced in the network. And this problem is this paper would research and solve.This paper focuses on the problem that hot files make load on memory space and bandwidth in an unbalanced condition. To solve this problem, Paper puts forward a load balance scheme. The scheme is mainly based on duplications transferring, to transfer the load to other light-loaded peers. The scheme includes four key points:(1) To compute the load, and to determine whether a node is light-loaded or over-loaded. The load level is determined by many factors, Paper choose one most important factor to define what load index is.(2) To organize and manage light-loaded peers. Light-loaded peers are resource all over the P2P network. Paper have one solution to make a best use of this resource。(3) To pick out light-loaded peers. Paper provides two way to transfer duplications according to the load distribution situation.(4) To manage duplications. Paper also provides suggestions about how to manage the number of duplications, to make it match the real needs.To test the scheme is effective, this paper simulates the scheme on Peersim. And result shows the scheme makes load more balanced and keeps stable.