Cart (Loading....) | Create Account
Close category search window
 

POND: The Power of Zone Overlapping in DHT Networks

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

3 Author(s)
Zhiyong Xu ; Suffolk Univ., Boston, MA ; Jizhong Han ; Laxmi Bhuyan

Distributed hash table (DHT) based algorithms have been proposed to solve the routing issues in large-scale peer-to-peer (P2P) applications. DHT systems create an elegant peer-to-peer service model and work perfect in a homogeneous environment. Workload are evenly distributed on every participating peer and system is supposed to achieve the optimal performance. However, in the real world, the complicated scenarios such as peerspsila capability heterogeneity, diverse file popularities, and mismatching problem between physical network structure and logical routing data structure, jeopardize the efficiency of DHT infrastructure and may result in serious load imbalance problem. In this paper, we propose -- POND, a novel and efficient DHT algorithm to relieve the above problem. In POND, peers are divided into two types: main peers (MP) and shadow peers(SP). As other DHT systems, POND splits the name space into several disjointed zones. However, unlike other systems which only have one peer in charge of each zone, in POND, we use zone overlapping technique. In each zone, a MP and several SPs are used for services. Any of them is capable to handle service requests fallen into this zone. When a new request is coming,the peer with the minimal load has the high possibility to be chosen to provide the service. Thus, the risk of overload problem is reduced. With the introduction of shadow peers, POND also provides better failure tolerance and relieves the hot spot problem. Moreover, POND can improve the routing performance by reducing the average number of routing hops per request. We conduct extensive simulation experiments and the results show POND is superior to other DHT algorithms.

Published in:

Networking, Architecture, and Storage, 2008. NAS '08. International Conference on

Date of Conference:

12-14 June 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.