How bad is naive multicast routing?
Top Cited Papers
- 31 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
When the problem of routing multicast connectionsin networks has been previously considered, the aimhas been to minimise overall costs, possibly subjectto a delay constraint. The emphasis has been on examiningthe problem with a source transmitting to afixed set of destinations (the multicast group) whichare known when communication is established. Thereare clearly some applications for which the set of destinationswill be dynamic, with destinations joining andleaving the multicast...Keywords
This publication has 8 references indexed in Scilit:
- Multicast routing algorithm for nodal load balancingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- On multicast path finding algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988
- Steiner problem in networks: A surveyNetworks, 1987
- On finding steiner verticesNetworks, 1986
- A fast algorithm for Steiner treesActa Informatica, 1981
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968