By Topic

Dynamic Load Balancing with Multiple Hash Functions in Structured P2P Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Yuqi Mu ; Beijing Univ. of Posts & Telecommun., Beijing, China ; Cuibo Yu ; Tao Ma ; Chunhong Zhang
more authors

P2P systems can be used to form a low latency decentralized data delivery system. 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 describes 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. Results from performance evaluation demonstrate the effectiveness of our approach.

Published in:

Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on

Date of Conference:

24-26 Sept. 2009