Abstract
This paper proposes a set of novel multicast algorithms for m-D mesh overlay networks that can achieve shorter multicast delay and less resource consumptions. In contrast to previous approaches, our algorithms partition the group members into clusters in the lower layer, seeking an optimal core (root) to guarantee the minimum routing delay for each cluster and building a shared tree within each cluster to minimize the number of links used. In the upper layer, a shared tree is then constructed using our algorithms to implement the inter-cluster routing. The extended simulation results indicate that the application layer multicast that is constructed by our algorithms is efficient in terms of routing delay and link utilizations as compared with other well-known existing multicast solutions.
This work is supported by Strategy Grant of City University of Hong Kong under nos 7001709 and 7001587 and partially by the National Grand Fundamental Research 973 Program of China under Grant No.2003CB317003.
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
Deering, S., Cheriton, D.: Multicast Routing in Datagram Internetworks and Extended LANs. ACM Transactions on Computer-Systems 8(2), 85–110 (1990)
Chu, H., Rao, S., Seshan, S., Zhang, H.: A case for end system multicast. In: Proc. of ACM SIGMETRICS 2000, Santa Clara, California, USA, June 17-21, 2000, pp. 1–12 (2000)
Francis, P.: Yoid: extending the internet multicast architecture (April 2000), http://www.aciri.org/yoid/docs/index.html
Banerjee, S., Bhattacharjee, B., Kommareddy, C.: Scalable application layer multicast. In: Proc. of ACM SIGCOMM, Pittsburgh, Pennsylvania, USA, August 19-23, 2002, pp. 205–217 (2002)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Application-level multicast using content-addressable networks. In: Proc. of The 3rd International Workshop on Network Group Communication, London, UK, November 7-9, 2001, pp. 14–29 (2001)
Jannotti, J., Gifford, D.K., Johnson, K.L., Frans Kaashoek, M., O’Toole Jr., J.W.: Overcast: reliable multicasting with an overlay network. In: Proc. of The 4th Usenix Symposium on Operating Systems Design and Implementation, Paradise Point Resort, San Diego, California, USA, October 22-25 (2000)
Pendarakis, D., Shi, S., Verma, D., Waldvogel, M.: ALMI: An application level multicast infrastructure. In: Proc. of The 3rd USENIX Symposium on Internet Technologies and Systems, Cathedral Hill Hotel, San Francisco, USA, March 26-28 (2001)
Chu, Y., Rao, S.G., Seshan, S., Zhang, H.: Enabling conferencing applications on the Internet using an overlay multicast architecture. In: Proc. of ACM SIGCOMM 2001, San Diego, California, USA, August 27-31, 2001, pp. 55–67 (2001)
Zhang, B., Jamin, S., Zhang, L.: Host multicast: a framework for delivering multicast to end users. In: Proc. of IEEE INFOCOM 2002, New York, USA, June 23-27, 2002, pp. 1366–1375 (2002)
Deshpande, H., Bawa, M., Garcia-Molina, H.: Streaming live media over a peer-to-peer network, Stanford Univ. Comput. Sci. Dept., Stanford, CA (June 2001)
Pendarakis, D., Shi, S., Verma, D., Waldvogel, M.: ALMI:An application level multicast infrastructure. In: Proc. 3rd Usenix Symp. Internet Technologies and Systems, San Francisco, CA, March 2001, pp. 49–60 (2001)
Stocia, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM 2001, San Diego, CA, August 2001, pp. 160–172 (2001)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing, Univ. California, Berkeley, CA (April 2001)
Lin, X., McKinley, P.K., Ni, L.M.: Deadlock-free multicast wormhole routing in 2-D mesh multicomputers. IEEE Trans. on Parallel And Distributed Systems 5, 793–804 (1994)
Lin, X., McKinley, P.K., Esfahanian, A.H.: Adaptive multicast wormhole routing in 2-D mesh multicomputers. In: Proc. of Parallel Architectures And Languages Europe 1993, pp. 228–241 (1993)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: ACM SIGCOM 2001, San Diego, CA, USA, August 27-31 (2001)
UC Berkeley, LBL, USC/ISI, and Xerox PARC, ns Notes and Documentation, (October 20, 1999)
Tu, W., Jia, W.: A scalable and efficient end host multicast for Peer-to-Peer Systems. In: Proc. of IEEE Globecom 2004, Dallas, Texas, USA, November 29-December 3, 2004, pp. 967–971 (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
Jia, W., Tu, W., Wu, J. (2005). Hierarchical Multicast Tree Algorithms for Application Layer Mesh Networks. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_59
Download citation
DOI: https://doi.org/10.1007/11534310_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28102-3
Online ISBN: 978-3-540-31868-2
eBook Packages: Computer ScienceComputer Science (R0)