Computing the bandwidth-delay-constrained least-cost multicast routing tree is an NP-
complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm …

Background In this paper, we study the bandwidth, delay, delay jitter, and packet loss-
constrained least-cost multicast routing problem which is known to be NP-complete, and …

QoS multicast routing is a non-linear combinatorial optimization problem that arises in many
multimedia applications. Providing QoS support is crucial to guarantee effective …

In the future Internet, multimedia applications will be strongly present. When a group of users
is concerned by the same traffic flow, the multicast communication can decrease …

QoS multicast routing is a non-linear combinatorial optimization problem that arises in many
multimedia applications. Providing QoS support is crucial to guarantee effective …

Most of the multimedia applications require strict QoS guarantee during the communication
between a single source and multiple destinations. This gives rise to the need for an efficient …

QoS multicast routing is a non-linear combinatorial optimization problem. It tries to find a
multicast routing tree with minimal cost that can satisfy constraints such as bandwidth, delay …

Most of the multimedia applications require strict quality of service (QoS) guarantee during
the communication between a single source and multiple destinations. This gives rise to the …

A method for least-cost QoS multicast routing based on genetic simulated annealing
algorithm (NGSA) is presented. Genetic algorithm and simulated annealing algorithm are …

For multimedia applications, the routing algorithms should consider many Quality of Service
(QoS) parameters. However, to find routes with two or more QoS parameters is an NP-hard …