Abstract
We present a new multicast algorithm called WAVE for establishing source-specific multicast trees. WAVE meets multiple quality of service requirements (constraints) such as delay, cost, and available bandwidth, simultaneously. Simulation results show that WAVE performs very good in terms of delay and cost for both, static and dynamic multicast groups, when compared to the best multicast algorithms known.
Preview
Unable to display preview. Download preview PDF.
References
T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, The MIT Press, 1990.
M. Doar and I. Leslie, How Bad is NaÏve Multicast Routing? Proc. INFOCOM 1993, 82ff.
L. Kou, G. Markowsky, and L. Berman, A Fast Algorithm for Steiner Trees. Acta Informatica, Vol. 15:141–145, 1981.
B. M. Waxman, Routing of Multipoint Connections. IEEE J. Selected Areas in Communications, Vol. 6, No. 9, December 1988, p. 1617 ff.
L. Wei and D. Estrin, The Trade-offs of Multicast Trees and Algorithms. Proc. Int. Conf. on Computer Communications and Networks, 1994.
R. Widyono, The Design and Evaluation of Routing Algorithms for Real-time Channels, University of California at Berkeley & International Computer Science Institute, TR-94-024, June 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biersack, E., Nonnenmacher, J. (1995). WAVE: A new multicast routing algorithm for static and dynamic multicast groups. In: Little, T.D.C., Gusella, R. (eds) Network and Operating Systems Support for Digital Audio and Video. NOSSDAV 1995. Lecture Notes in Computer Science, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019274
Download citation
DOI: https://doi.org/10.1007/BFb0019274
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60647-5
Online ISBN: 978-3-540-48524-7
eBook Packages: Springer Book Archive