Similar articles

Abstract: The maintaining overheads of distributed Hash Table (DHT) topology have recently received considerable attention. This paper presents a novel SHT (session heterogeneity Topology) model, in which DHT is reconstructed with session heterogeneity. SHT clusters nodes by means of session heterogeneity among nodes and selects the stable nodes as the participants of DHT. With an evolving process, this model gradually makes DHT stable and reliable. Therefore the high maintaining overheads for DHT are effectively controlled. Simulation with real traces of session distribution showed that the maintaining overheads are reduced dramatically and that the data availability is greatly improved.

[1] Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I., 2003. Looking up data in P2P systems. Communications of the ACM, 46(2):43-48.

[2] Bhagwan, R., Savage, S., Voelker, G.M., 2003. Understanding Availability. The 2nd International Workshop on Peer-to-Peer Systems. Berkeley, CA, USA.

[3] Druschel, P., Rowstronand, A., 2001. Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-Peer Systems. Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms. Heidelberg, Germany, p.329-350.

[4] Hazel, S., Wiley, B., 2002. Achord: A Variant of the Chord Lookup Service for Use in Censorship Resistant Peer-to-Peer Publishing Systems. Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS’02). MIT Faculty Club, Cambridge, MA, USA.

[5] IRIS Project, 2004. http://project-iris.net/.

[6] Ledlie, J., Taylor, J., Serban, L., Seltzer, M., 2002. Self-Organization in Peer-to-Peer Systems. The 10th ACM SIGOPS European Workshop.

[7] Liben-Nowell, D., Balakrishnan, H., Karger, D., 2002. Analysis of the Evolution of Peer-to-Peer Systems. Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing. ACM Press, p.233-242.

[8] Limewire, 2004. http://www.limewire.com.

[9] Mahajan, R., Castro, M., Rowstron, A., 2003. Controlling the Cost of Reliability in Peer-to-Peer Overlays. The 2nd International Workshop on Peer-to-Peer Systems. Berkeley, CA, USA.

[10] Markatos, E.P., 2002. Tracing A Large-Scale Peer to Peer System: An Hour in the Life of Gnutella. The 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid. IEEE Computer Society, Washington, DC, USA.

[11] Morpheus, 2004. http://www.musiccity.com.

[12] Ratnasamy, S., Shenker, S., Stoica, I., 2002. Routing Algorithms for DHTs: Some Open Questions. Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS’02), Cambridge, MA, USA.

[13] Saroiu, S., Gummadi, P.K., Gribble, S.D., 2002. A Measurement Study of Peer-to-Peer File Sharing Systems. Proceedings of Multimedia Conferencing and Networking. San Jose, CA.

[14] Sen, S., Wang, J., 2002. Analyzing Peer-to-Peer Traffic Across Large Networks. Proc. of ACM SIGCOMM Internet Measurement Workshop. ACM Press, New York, NY, USA.

[15] Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H., 2001. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. Proc. of ACM SIGCOMM. San Diego, CA.

[16] Sylvia, R., Paul, F., Mark, H., Richard, K., Scott, S., 2001. A Scalable Content-Addressable Network. Proc. ACM SIGCOMM. San Diego, CA, p.161-172.

[17] Wu, Z.D., Ma, F.Y., Rao, W.X., 2004. Super-proximity routing in structured P2P networks. Journal of Zhejiang University SCIENCE, 5(1):16-21.

[18] Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J., 2004. Tapestry: A resilient global scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22(1):41-53.