Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
A source-based algorithm for delay-constrained minimum-cost multicasting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Multicast Routing with End-to-End Delay and Delay Variation Constraints
Multicast Routing with End-to-End Delay and Delay Variation Constraints
A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay
International Journal of Network Management
Multicast Routing by Multiple Tree Routes
QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks
Alternate path routing for multicast
IEEE/ACM Transactions on Networking (TON)
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
QROUTE: an QoS-guaranteed multicast routing
Computer Communications
Analysis of the performance of dynamic multicast routing algorithms
Computer Communications
Real-time optimal multicast routing
Computer Communications
A routing algorithm for dynamic multicast trees with end-to-end path length control
Computer Communications
QoS-driven multicast routing in sparse-splitting optical networks
Photonic Network Communications
| Hi-index | 0.00 |
We study the problem of constructing multicast trees to meet the quality of service requirements of real-time, interactive applications opeipating in high-speed packet-switched environments. In particular, we assume that multicast communication depends on (a) bounded delay along the paths from the source to each destination, and (b) bounded variation among th8e delays along these paths. We first establish that the problem of determinzng such a constrained tree is NP-complete. We then derive heuristics that demonstrate good average case behavior in terms of the maximum inter-destination delay varaation of the final tree. We also show how to dynamically reorganize the initial tree an response to changes in the de.stinatzon set, in a way that is minimally disruptive to the multicast session.