A group multicast routing algorithm by using multiple minimum Steiner trees
- 1 September 1997
- journal article
- Published by Elsevier in Computer Communications
- Vol. 20 (9) , 750-758
- https://doi.org/10.1016/s0140-3664(97)00081-9
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Distributed algorithms for multicast path setup in data networksIEEE/ACM Transactions on Networking, 1996
- Multicast routing extensions for OSPFCommunications of the ACM, 1994
- Steiner tree problemsNetworks, 1992
- Multicast routing in datagram internetworks and extended LANsACM Transactions on Computer Systems, 1990
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988
- Steiner problem in networks: A surveyNetworks, 1987
- A dual ascent approach for steiner tree problems on a directed graphMathematical Programming, 1984
- Routing to Multiple Destinations in Computer NetworksIEEE Transactions on Communications, 1983