A practical peer-performance-aware DHT

Authors:
Yan Tang;Zhengguo Hu;Yang Zhang;Lin Zhang;Changquan Ai
Affiliations:
School of Computer, Northwestern Polytechnical University, Xi'an, P.R. China;School of Computer, Northwestern Polytechnical University, Xi'an, P.R. China;School of Computer, Northwestern Polytechnical University, Xi'an, P.R. China;School of Computer, Northwestern Polytechnical University, Xi'an, P.R. China;School of Computer, Northwestern Polytechnical University, Xi'an, P.R. China
Venue:
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
Year:
2004

Citing 7
Cited 0

Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm

IEEE Transactions on Parallel and Distributed Systems
Routing Algorithms for DHTs: Some Open Questions

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
An Efficient Peer-to-Peer File Sharing Exploiting Hierarchy and Asymmetry

SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet
Efficient, Proximity-Aware Load Balancing for Structured P2P Systems

P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
One hop lookups for peer-to-peer overlays

HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
SmartBoa: constructing p2p overlay network in the heterogeneous internet using irregular routing tables

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

How to Build an efficient Distributed Hash Table (DHT) is a fundamental issue in Peer-to-Peer research field. Previous solutions ignore the heterogeneity of the large scale network. However, in practice, the fact is that the resource held by each peer in the Internet is extremely diverse. And the the willing to share local resources of each peer is also diverse. Therefore, the contribution for the system of a peer should depend on the resources it holds or how many resources it want to share, and should not be uniform. In this paper, we propose a Peer-Performance-Aware Distributed Hash Table (PPADHT) which aims to exploit the heterogeneity. It takes the performance difference of peers into consideration to construct a dynamic variation of wrapped butterfly to achieve the goal. We also show how to optimize the performance of PPADHT in the view of hop counts by random graphs. Our simulation results show that the average lookup hop counts of the PPADHT is approximately a log scale with constant out degrees. And it can achieve loadbalance in two ways: both the document load and message routing load, without introducing any additional load on the peer. Here, the load balance means the load is proportion to the performance of peer.