Abstract
We formulate bandwidth maximization problems in multicasting streaming data. Multicasting is used to stream data to many terminals simultaneously. The goal here is to maximize the bandwidth at which the data can be transmitted satisfying the capacity constraints on the links. A typical network consists of the end-hosts which are capable of duplicating data instantaneously, and the routers which can only forward the data. We show that if one insists that all the data to a terminal should travel along a single path, then it is NP-hard to approximate the maximum bandwidth to a factor better than 2. We also present a fast 2-approximation algorithm. If different parts of the data to a terminal can travel along different paths, the problem can be approximated to the same factor as the minimum Steiner tree problem on undirected graphs. We also prove that in case of a tree network, both versions of the bandwidth maximization problem can be solved optimally in polynomial time. Of independent interest is our result that the minimum Steiner tree problem on tree-metrics can be solved in polynomial time.
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
Atteson, K.: The performance of neighbor-joining methods of phylogenetic reconstruction. Algorithmica 25, 251–278 (1999)
Chawathe, Y.: Scattercast: An Architecture for Internet Broadcast Distribution as an Infrastucture Service. PhD thesis, University of California, Berkeley (2000)
Francis, P.: Yoid: Extending the multicast internet architecture. White paper (1999), http://www.aciri.org/yoid/
Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)
Chu, Y.H., Rao, S.G., Zhang, H.: A case for end system multicast (keynote address). In: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pp. 1–12. ACM Press, New York (2000)
Jain, K., Mahdian, M., Salavatipour, M.: Packing steiner trees. In: Proceedings, ACM-SIAM Symposium on Discrete Algorithms (2003)
Jannotti, J., Gifford, D.K., Johnson, K.L., Kaashoek, M.F., O’Toole Jr., J.W.: Overcast: Reliable multicasting with an overlay network. In: Proceedings of the 4th Symposium on Operating System Design and Implementation, pp. 197–212
Pendarakis, D., Shi, S., Verma, D., Waldvogel, M.: ALMI: An application level multicast infrastructure. In: Proceedings of the 3rd USNIX Symposium on Internet Technologies and Systems (USITS 2001), San Francisco, CA, USA, March 2001, pp. 49–60 (2001)
Saitou, N., Nei, M.: The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4, 406–425 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garg, N., Khandekar, R., Kunal, K., Pandit, V. (2003). Bandwidth Maximization in Multicasting. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive