— 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-toPeer 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 peers’ 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...
Zhiyong Xu, Jizhong Han, Laxmi N. Bhuyan