Abstract
Multicast is an effective means for conducting the cooperative P2P communications. This paper studies an algorithm to construct a scalable and efficient end host multicast tree – Shared Cluster Tree (SCT). Compared with the previous work, by utilizing the underlying network properties, the novelty and contributions of our multicast algorithms are: (1) Scalability: by fully utilizing the underlying network properties to layer and cluster the group members, SCT decreases the transfer of the data traffic in the backbone domain links and therefore reserves more backbone domain resources to more local domains which include many more end hosts; (2) Efficiency: by searching the cluster cores based on the cluster core selection method, packets are multicasted to the cluster members by the cluster cores in the minimum delay. Our simulation results indicate that SCT is scalable and efficient for the end host multicast in P2P systems...
The work is supported by Research grant council (RGC) Hong Kong, SAR China under CityU strategic grant nos. 7001587.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lv, C., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. Optinal (2001) (preprint)
Cohen, E., Shenker, S.: Optimal replication in random search networks. Optional (2001) (preprint)
Lv, Q., Ratnasamy, S., Shenker, S.: Can heterogeneity make gnutella scalable? In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 94. Springer, Heidelberg (2002)
Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A scalable content-addressable network. In: Proc. Of ACM SIGCOMM 2001 (August 2001)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Applicationlevel multicast using content-addressable networks. In: Proc. Of ACM SIGCOMM 2001, August 2001, vol. 8(4) (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems (2001), Available at http://research.mecrosoft.com/antr/PAST/
Zhao, B.Y., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for faulttolerant wide-area location and routing (2001), Available at http://www.cs.berkeley.edu/ravenben/tapestry/
Chu, Y.H., Rao, S.G., Zhang, H.: A case for end system multicast. In: Proc. of ACM SIGMETRICS (June 2000)
Francis, P.: Yoid: Extending the multicast internet architecture, White paper, http://www.aciri.org/yoid/,1999
Banerjee, S., Bhattacharjee, B., Kommareddy, C.: Scalable application layer multicast. In: Proc. of ACM SIGCOMM (August 2002)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Applicationlevel multicast using content-addressable networks. In: Proc. of NGC (2001)
UC Berkeley,LBL,USC/ISI,and Xerox PARC, ns Notes and Documentation, October 20 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tu, W., Jia, W. (2004). End Host Multicast for Peer-to-Peer Systems. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_69
Download citation
DOI: https://doi.org/10.1007/978-3-540-30208-7_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23564-4
Online ISBN: 978-3-540-30208-7
eBook Packages: Springer Book Archive