Abstract
The structured peer-to-peer system, which is based on the distributed hash table, offers an administration-free and fault-tolerant application-level overlay network. However, a randomly structured overlay can not reflect the heterogeneity of a peer-to-peer system. In this paper, we propose a two-phase approach to exploit the heterogeneity in structured peer-to-peer systems. First, by exploiting the effects of both connections and nodes, we adjust the structure of overlay to reduce the lookup latency. And then a novel load balancing scheme based on lottery scheduling is proposed to balance not only the load but also the movement cost of the load. Our simulation results show that the performance, including query quality from the users’ view and load balance from the system’s view, can be greatly improved in a heterogeneous environment.
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
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of the ACM SIGCOMM (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the ACM SIGCOMM (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms, Middleware (2001)
Xu, Z., Mahalingam, M., Karlsson, M.: Turning heterogeneity into an advantage in overlay routing. In: Proceedings of IEEE INFOCOM (2003)
Hu, J., Li, M., Zheng, W., Wang, D., Ning, N., Dong, H.: Smartboa: Constructing P2P overlay network in the heterogeneous Internet using irregular routing tables. In: 3rd International workshop on P2P Systems (IPTPS 2004) (2004)
Godfrey, B., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load balancing in dynamic structured P2P systems. In: Proceedings of IEEE INFOCOM (2004)
Godfrey, P.B., Stoica, I.: Heterogeneity and load balance in distributed hash tables. In: Proceedings of IEEE INFOCOM (2005)
Qiu, T., Wu, F., Chen, G.: A generic approach to make structured P2P systems topology-aware. In: Pan, Y., Chen, D.-x., Guo, M., Cao, J., Dongarra, J. (eds.) ISPA 2005. LNCS, vol. 3758, pp. 816–826. Springer, Heidelberg (2005)
Waldspurger, C.A.: Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management. PhD thesis, Massachusetts Inst. Technol. (1995)
Zhu, Y., Hu, Y.: Towards efficient load balancing in structured P2P systems. In: Proceedings of the 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (2004)
Zegura, E.W., Calvert, K.L., Bhattacharjee., S.: How to model an internetwork. In: Proceedings of INFOCOM (1996)
Chun, S.G., Zhao, B.Y., Kubiatowicz, J.D.: Impact of neighbor selection on performance and resilience of structured P2P networks. In: International workshop on P2P Systems (IPTPS 2005) (2005)
Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load balancing in structured P2P systems. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
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
Qiu, T., Chen, G. (2005). Exploiting the Heterogeneity in Structured Peer-to-Peer Systems. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_100
Download citation
DOI: https://doi.org/10.1007/11590354_100
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30510-1
Online ISBN: 978-3-540-32277-1
eBook Packages: Computer ScienceComputer Science (R0)