Research On Load Balancing Based On Query Hotspot In Structured Peer-To-Peer Networks

P2P systems can be used to form a low latency decentralized data delivery system. It has been used more and more widely. Structured P2P systems provide both low latency and excellent load balance with uniform query and data distributions, however, in the real application environment, requests distributions are often skewed and follow a Zipf law, some objects will become hotspots, individual nodes are easily overloaded, resulting in poor global performance and lost messages.This paper reviews on the technology of the current load balanding 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 proposed a novel approach with multiple hash functions to replicate the hotspots in a series of different nodes to distribute the high load evenly, and it can increase or decrease the replicas dynamically. At the same time it maintains low access latencies and good load balancing even under highly skewed demand.Firstly, the Peer-to-Peer networks and the technology of the current load balancing for structured Peer-to-Peer networks are introduced. Secondly, the implement and algorithm of the approach proposed in this paper are introduced by theory analysis, and the cost problem needed by this approach is analyzed. At last, results from performance evaluation demonstrate the effectiveness of this approach, and an improvement of this approach is given.