Graphs: theory and algorithms
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
The MASC/BGMP architecture for inter-domain multicast routing
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing
AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Research challenges in QoS routing
Computer Communications
A multi-constrained multicast QoS routing algorithm
Computer Communications
Unicast and multicast qos routing with multiple constraints
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
MAMCRA: a constrained-based multicast routing algorithm
Computer Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In this paper, we define the cost optimal solution of the multi-constrained multicast routing problem. This problem consists in finding a multicast structure that spans a source node and a set of destinations with respect to a set of constraints, while minimizing a cost function. This optimization is particularly interesting for multicast network communications that require Quality of Service (QoS) guarantees. Finding such a structure that satisfies the set of constraints is an NP-hard problem. To solve the addressed routing problem, most of the proposed algorithms focus on multicast trees. In some cases, the optimal spanning structure (i.e. the optimal multicast route) is neither a tree nor a set of trees nor a set of optimal QoS paths. The main result of our study is the exact identification of this optimal solution. We demonstrate that the optimal connected partial spanning structure that solves the multi-constrained multicast routing problem always corresponds to a hierarchy, a recently proposed generalization of the tree concept. We define the directed partial minimum spanning hierarchies as optimal solutions for the multi-constrained multicast routing problem and analyze their relevant properties. To our knowledge, our paper is the first study that exactly describes the cost optimal solution of this NP-hard problem.