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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Saroiu, S., Kwon, G., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Conferencing and Networking, 156–170 (2002)
Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for dhts: Some open questions. In: Proceedings of 1st International Workshop on Peer-to-Peer Systems
Gisik Kwon, K.D.R.: An efficient peer-to-peer file sharing exploiting hierarchy and asymmetry. In: Proceedings of SAINT 2003 (2003)
Zhu, Y., Yiming Hu, E.: Proximity-aware load balancing for structured p2p systems. In: Proceedings of P2P 2003 (2003)
Hu, J., Li, M., Zheng, W.-M., Wang, D., Ning, N., Dong, H.: Smartboa: Constructing p2p overlay network in the heterogeneous internet using irregular routing tables. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 278–287. Springer, Heidelberg (2004)
Gupta, A.: Barbara Liskov, R.R.: One hop lookups for peer-to-peer overlays. In: Proceedings of HOTOS IX
David, S.L., Wei, F.P.M.I., Naik, K.: Isomorphism of degree four cayley graph and wrapped butterfly and their optimal permutation routing algorithm. IEEE Transactions On Parallel And Distributed Systems
Matsumoto, M., Nishimura, T.: Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Trans. on Modeling and Computer Simulation 8, 3–30 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tang, Y., Hu, Z., Zhang, Y., Zhang, L., Ai, C. (2005). A Practical Peer-Performance-Aware DHT. In: Moro, G., Bergamaschi, S., Aberer, K. (eds) Agents and Peer-to-Peer Computing. AP2PC 2004. Lecture Notes in Computer Science(), vol 3601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11574781_18
Download citation
DOI: https://doi.org/10.1007/11574781_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29755-0
Online ISBN: 978-3-540-31657-2
eBook Packages: Computer ScienceComputer Science (R0)