A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 7 (4), 514-529
- https://doi.org/10.1109/90.793020
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Performance evaluation of multipoint routing algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Preferred link based delay-constrained least-cost routing in wide area networksComputer Communications, 1998
- Distributed algorithms for multicast path setup in data networksIEEE/ACM Transactions on Networking, 1996
- The PIM architecture for wide-area multicast routingIEEE/ACM Transactions on Networking, 1996
- Multicast routing for multimedia communicationIEEE/ACM Transactions on Networking, 1993
- Steiner tree problemsNetworks, 1992
- Dynamic Steiner Tree ProblemSIAM Journal on Discrete Mathematics, 1991
- Routing to Multiple Destinations in Computer NetworksIEEE Transactions on Communications, 1983
- A fast algorithm for Steiner treesActa Informatica, 1981