Abstract
In this paper we first investigate the problem of finding a delay- and degree-bounded maximum sum of nodes ALMT. We proved the problem is NP-hard, and testify its relationship with the well-studied degree-bounded minimum maximum-delay ALMT problem. We proposed a greedy algorithm FindOverlayTree with SRPF heuristic. The simulation results show that our design solution is a valid and cost-effective approach where compared to other three modified classic heuristics under several performance metrics.
The research work was supported by NSF project no. 60433040 and 973 project no. 2005CB321801.
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
Steinmetz, R., Nahrstedt, K.: Multimedia: Computing, Communications and Applications. Prentice Hall, Inc., Englewood Cliffs (1995)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1997)
Malouch, N.M., Liu, Z., Rubenstein, D., Sahu, S.: A Graph Theoretic Approach to Bounding Delay in Proxy-Assisted, End-System Multicast. In: Proceedings of the Tenth International Workshop on Quality of Service, IWQoS 2002 (2002)
Shi, S.Y., Turner, J.S., Waldvogel, M.: Dimensioning Server Access Bandwidth and Multicast Routing in Overlay Networks. In: The 11th International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV 2001), June 25-27(2001)
Riabov, A., Liu, Z., Zhang, L.: Overlay Multicast Trees of Minimal Delay. In: Proceeding of the 24th International Conference on Distributed Computing Systems, ICDCS 2004 (2004)
Tan, S.W., Waters, G., Crawford, J.: MeshTree: A delay-optimised Overlay Multicast Tree Building Protocol. In: Submitted to proceeding of IEEE INFOCOM 2005 (2005)
Brosh, E., Shavitt, Y.: Approximation and Heuristic Algorithms for Minimum Delay Application-Layer Multicast Trees. In: Proceeding of IEEE INFOCOM 2004 (2004)
Banejee, S., Kommareddy, C., Kar, K., Bhattacharjee, B., Khuller, S.: Construction of an Efficient Overlay Multicast Infrastructure for Real-time Application. In: Proceeding of IEEE INFOCOM 2003 (2003)
Cui, Y., Xue, Y., Nahrstedt, K.: Max-Min Overlay Multicast: Rate Allocation and Tree Construction. In: Proceeding of IWQoS 2004 (2004)
Yang, M., Fei, Z.: A Proactive Approach to Reconstructing Overlay Multicast Trees. In: Proceeding of INFOCOM 2004 (2004)
Bhat, P.B., Raghavendra, C.S., Prasanna, V.K.: Efficient Collective Communication in Distributed Heterogeneous Systems
Banikazemi, M., Moorthy, V., Panda, D.K.: Efficient collective communication on heterogeneous networks of workstations. In: Proc. Intl. Conf. Parallel Processing, pp. 460–467 (1998)
Yeo, C.K., Lee, B.S., Er, M.H.: A survey of application level multicast techniques. ELSEVIER Computer Communication 27, 1547–1568 (2004)
Castro, M., Druschel, P., Kermarrec, A.M., Rowstron, A.: SCRIBE:A large-scale and decentralized application-level multicast infrastructure. JSACÂ 20(8) (October 2002)
Castro, M., Druschel, P., Kermarrec, A.M., Nadi, A., Rowstron, A., Singh, A.: SplitStream:High-Bandwidth Multicast in Cooperative Environments. In: Proceeding of SOSP 2003, October 19-22 (2003)
Ratnasamy, S., Handley, M., Karp, R., Shenkar, S.: Application-level multicast using content addressable networks. In: Proceeding of the Third International Workshop on Networked Group Communication (NGC), pp. 14–29 (2001)
Chu, Y.H., Rao, S.G., Seshan, S., Zhang, H.: A Case for End System Multicast. In: SIGMETRICS 2000 (June 2000)
Banerjee, S., Bhattacharjee, B., Kommareddy, C.: Scalable Application Layer Multicast. In: SIGCOMM 2002, August 19-23 (2002)
Tran, D.A., Hua, K.A., Do, T.T.: Peer-to-Peer Streaming Using A Novel Hierarchical Clustering Approach. In: ACM-MM 2002 (2002)
Jannotti, J., Gifford, D.K., Johnson, K.L.: Overcast:Reliable Multicasting with an overlay Network. In: Proceeding of OSDI 2000, October 2000, pp. 197–212 (2000)
Francis, P.: Yoid:Extending the Internet Multicast Architecture (March 2001), http://www.icir.org/yoid/
Kim, M.S., Lam, S.S., Lee, D.Y.: Optimal Distribution Tree for Internet Streaming Media. In: ICDCS 2003 (2003)
Sasabe, M., Wakamiya, N., Murata, M., Miyahara, H.: Scalable and Continuous Media Streaming on Peer-to-Peer Networks. In: P2P 2003. Osaka University (2003)
Liebeherr, L., Nahas, M., Si, W.: Application-layer multicast with Delaunay triangulations. IEEE J.Select. Areas Communication  20(8) (2002)
Pendarakis, D., Shi, S., Verma, D., Waldvogel, M.: ALMI: an Application Level Multicast Infrastructure. In: Proceeding of the Third Usenix Symposium on Internet Technologies and Systems (USITS) (March 2001)
Chawathe, Y.D.: Scattercast:an architecture for Internet broadcast distribution as an infrastructure service. PhD thesis, Stanford University (September 2000)
Hefeeda, M., Habib, A., Xu, D., Bhargava, B., Botev, B.: CollectCast: A Peer-to-Peer Service for Media Streaming. Submitted to ACM/Springer Multimedia Systems Journal (October 2003)
Hefeeda, M., Habib, A., Botev, B., Xu, D., Bhargava, B.: PROMISE: Peer-to-Peer Media Streaming Using CollectCast. In: Proc.of ACM Multimedia 2003, November 2003, pp. 45–54 (2003)
Calvert, K.L., Doar, M.B., Zegura, E.W.: Modeling Internet Topology. IEEE Communications Magazine (1997)
Calvert, K., Zegura, E.: Gt internetwork topology models(gt-itm) (1997), http://www.cc.gatech.edu/fac/Ellen.Zegura/graphs.html
BRITE project, http://www.cs.bu.edu/brite/
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-Law Relationships of the Internet Topology. In: SIGCOMM 1999, Cambridge, MA, USA (1999)
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
Liu, F., Lu, X., Peng, Y. (2005). An Efficient Heuristic Algorithm for Constructing Delay- and Degree-Bounded Application-Level Multicast Tree. 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_135
Download citation
DOI: https://doi.org/10.1007/11590354_135
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)