Research On Load Balancing Caused By Query Hotspot Based On Structured Peer-to-Peer Networks

The heterogeneity of node capacities can cause a load imbalance problem. There are several popular nodes being requested most of the time, when flash crowd happens, the amount of the requests for the popular objects can increase dramatically to tens or hundreds of times as compared with the original amount. It easily causes problems of query hotspot. Such nodes may suffer from severe performance failures, and almost all the services they provide will become unavailable. So, how to adjust distributing of resource is very important, and it has remarkable significance to improve performance of Peer-to-Peer networks by the research of load balancing. Because of equality and no center, those traditional load balancing algorithms, based the center, are not applicable.The studies of load balancing should consider the characteristic of P2P. This paper reviews on the technology of the current load balancing for the analysis and research. In a comprehensive and detailed analysis of the cause of query hotspot's problems and the main solution, this paper proposes a new load balancing scheme based on taking link latency into account. This new scheme solves the two limitations of the existing load balancing approaches. First, loads are not moved between the nodes with smaller link latency. Second, they heavily rely on some nodes of fixed locations in the system. So, they will cause problems of a single-point failure easily. Meanwhile, this paper builds a simple simulation system according to this new scheme. At last, this paper perform a series of comparative experiments to validate the algorithm of load moved in this scheme, and the experiments' results show that the algorithm can balance the load of nodes effectively.