Abstract
DHT technique has been widely applied in P2P systems because it provides reliable services. However, large overheads are inevitable for maintaining the topology of DHT overlay, which limits its application especially in highly dynamic network environments. This paper proposes a DHT based super-peer overlay network called SPChord in which peer nodes are clustered according to the session time and physical network locality. With an evolving process, SPChord gradually makes DHT overlay stable and reliable. Therefore the high maintaining overheads for DHT overlay are effectively controlled. Experimental results show that the DHT overlay maintaining overheads are reduced dramatically while the overlay stability and the data availability are also greatly improved.
Supported by The Science & Technology Committee of Shanghai Municipality Key Project Grant 03dz15027 and 03dz15028.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: 17th ACM Symposium on Operating Systems Principles (SOSP 2000), November 2000, pp. 190–201 (2000)
Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Widearea cooperative storage with CFS. In: 18th ACM Symposium on Operating Systems Principles (SOSP 2001), October 2001, pp. 202–215 (2001)
Padmanabhan, V.N., Wang, H.J., Chou, P.A., Sripanidkulchai, K.: Distributing streaming media content using cooperative networking. In: 12th International Workshop on Network and Operating Systems Support for Digital Audio and Video (May 2002)
Padmanabhan, V.N., Sripanidkulchai, K.: The case for cooperative networking. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 178. Springer, Heidelberg (2002)
Tang, C., Xu, Z., Mahalingam, M.: pSearch: Information retrieval in structured overlays. In: 1st Workshop on Hot Topics on Networks (HotNets-I) (October 2002)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: 2001 ACM SIGCOMM Conference, pp. 149–160 (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), November 2001, pp. 329–350 (2001)
Saroiu, S., Gummadi, K., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Conferencing and Networking, San Jose (January 2002)
Ledlie, J., Taylor, J.M., Serban, L., Seltzer, M.: Self-Organization in Peer-to-Peer Systems. In: SIGOPS 2002 (2002)
Ng, S.E., Zhang, H.: Predicting Internet Network Distance with Coordinates-Based Approaches. In: IEEE INFOCOM 2002 (2002)
Pias, M., Crowcroft, J., Wilbur, S., Harris, T., Bhatti, S.: Lighthouse for Scalable Distributed Location. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Xu, Z., Tang, C., Zhang, Z.: Building Topology-Aware Overlays Using Global Soft-State. In: ICDCS 2003 (2003)
Xu, Z., Mahalingam, M., Karlsson, M.: Turning Heterogeneity into an Advantage in Overlay Routing. In: Infocom 2003 (2003)
Markatos, E.P.: Tracing a large-scale Peer to Peer System: an hour in the life of Gnutella. In: 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (2002)
Ratoasamy, S., Shenker, S., Stoica, I.: Routing Algorithms for DHTs: Some Open Questions. In: Proceedings for the 1st International Workshop on Peer-to-Peer Systems (IPTFS 2002), Cambridge, MA, USA, 7-8 March (2002)
Hazel, S., Wiley, B.: Achord: A variant of the chord lookup service for use in censorship resistant peer-to-peer publishing systems. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429. Springer, Heidelberg (2002)
Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proccedings of the ICCDE 2003 (March 2003)
Wu, Z.D., Ma, F.Y., Rao, W.X.: Super-proximity routing in Structured P2P Networks. Journal of Zhejiang University Science 5(1), 16–21 (2004)
Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the evolution of peer-to-peer systems. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, pp. 233–242. ACM Press, New York (2002)
Mahajan, R., Castro, M., Rowstron, A.: Controlling the Cost of Reliability in Peer-to-Peer Overlays. In: the 2nd International Workshop on Peer-to-peer systems, Berkeley, CA, USA (2003)
Loser, A., Naumann, F., Siberski, W., Nejdl, W., Thaden, U.: Semantic overlay clusters within super-peer networks. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, pp. 33–47. Springer, Heidelberg (2004)
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
Li, Y., Huang, X., Ma, F., Zou, F. (2005). Building Efficient Super-Peer Overlay Network for DHT 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_99
Download citation
DOI: https://doi.org/10.1007/11590354_99
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)