Multicasting for multimedia applications
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2078-2085 vol.3
- https://doi.org/10.1109/infcom.1992.263480
Abstract
The authors investigate multicast routing for high-bandwidth delay-sensitive applications in a point-to-point network as an optimization problem. They associate an edge cost and an edge delay with each edge in the network. The problem is to construct a tree spanning the destination nodes, such that it has the least cost, and so that the delay on the path from the source to each destination is bounded. Since the problem is computationally intractable, the authors present an efficient approximation algorithm. Experimental results through simulations show that the performance of the heuristic is near optimal.Keywords
This publication has 12 references indexed in Scilit:
- Support for continuous media in the DASH systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multicast routing in datagram internetworks and extended LANsACM Transactions on Computer Systems, 1990
- A scheme for real-time channel establishment in wide-area networksIEEE Journal on Selected Areas in Communications, 1990
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988
- Multicast Communication on Network ComputersIEEE Software, 1985
- Routing to Multiple Destinations in Computer NetworksIEEE Transactions on Communications, 1983
- The computation of nearly minimal Steiner trees in graphsInternational Journal of Mathematical Education in Science and Technology, 1983
- A fast algorithm for Steiner treesActa Informatica, 1981
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957