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
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
BRITE: Universal Topology Generation from a User''s Perspective
BRITE: Universal Topology Generation from a User''s Perspective
MAMCRA: a constrained-based multicast routing algorithm
Computer Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
Quality of service (QoS) provisioning in core-based tree multicast
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
Traffic distribution for end-to-end QoS routing with multicast multichannel services
The Journal of Supercomputing
The cost optimal solution of the multi-constrained multicast routing problem
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.24 |
Opposed to the situation that the constrained minimum Steiner tree (CMST) problem has been attracting much attention in quality of service (QoS) routing area, little work has been done on multicast routing subject to multiple additive constraints even though this is required by many emerging applications. In this paper, we propose a heuristic HMCMC to find feasible solutions to this problem. HMCMC has a provably low time complexity, and its basic idea is to construct a multicast tree step-by-step, which is done essentially based on the latest research results on multi-constrained unicast routing. Computer simulations demonstrate that HMCMC can achieve a high success ratio of finding feasible solutions.