Multicast routing with multiple QoS constraints in ATM networks

Wu, Jang-Jiin; Hwang, Ren-Hung; Lu, Hsueh-I

doi:10.1016/s0020-0255(99)00102-4

Cited by 35 publications

(18 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some of them have used the traditional wellknown crossover operators, such as the following schemes: † One point crossover operator [18] † One point crossover operator, with a fixed probability P c ð< 0:6 -0:9Þ [11] † Two point crossover operator [19] † One point crossover operator plus 'and' and 'or' logic operations with a fixed probability P c [20] Unfortunately, according to the genotype representation in these papers, the above crossover operators are not suitable for recombination of two individuals (the crossover operation mostly leads to illegal individuals). However, Ravikumar et al [21] have proposed a new interesting approach for crossover of Steiner trees and Wang et al [22] have used the same scheme with some modifications.…”

Section: Crossovermentioning

confidence: 99%

See 1 more Smart Citation

GA-Based Heuristic Algorithms for QoS Based Multicast Routing

Haghighat

Faez

Dehghan

et al. 2003

Knowledge-Based Systems

View full text Add to dashboard Cite

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 based on the genetic algorithms (GA). In the proposed algorithm, the connectivity matrix of edges is used for genotype representation. Some novel heuristics are also proposed for mutation, crossover, and creation of random individuals. We evaluate the performance and efficiency of the proposed GA-based algorithm in comparison with other existing heuristic and GA-based algorithms by the result of simulation. The proposed algorithm has overcome all of the previous algorithms in the literature. q

show abstract

Section: Crossovermentioning

confidence: 99%

“…This algorithm also assumes the delay constraints for all destinations are identical. Also, Wu et al [19] have proposed a GA-based algorithm for multiple QoS constraints multicast routing problem in general case. However, their proposed genotype representation does not necessarily represent a tree.…”

Section: Introductionmentioning

confidence: 99%

GA-Based Heuristic Algorithms for QoS Based Multicast Routing

Haghighat

Faez

Dehghan

et al. 2003

Knowledge-Based Systems

View full text Add to dashboard Cite

show abstract

“…Most of previous research on finding a multicast tree considers only one or two QoS constraints, like delay and jitter [8,9,10,11]. As far we know, only two methods have been published [6,13] recently for the MCMT problem. In paper [6], an algorithm named MAMCRA is proposed for the MCMT problem.…”

Section: Introductionmentioning

confidence: 99%

“…In paper [13], a heuristic based on genetic algorithm called MCMGA is proposed. The goal of this method is not just to find a feasible multicast tree, but also to minimize the cost of the tree.…”

Section: Introductionmentioning

confidence: 99%

A Heuristic Algorithm for the Multi-constrained Multicast Tree

Yang

2003

Management of Multimedia Networks and Services

View full text Add to dashboard Cite

Abstract.Multicasting is an important communication mechanism for implementing real-time multimedia applications, which usually require the underlying network to provide a number of quality-of-service (QoS) guarantees to users. In this paper, we study the problem concerning how to find a feasible multicast tree in which all the multicast paths satisfy the given set of QoS constraints. This problem is referred as the multiconstrained multicast tree (MCMT) problem. Based on tabu-search technique, a heuristic algorithm named MCMTS for the MCMT problem is proposed in this study. According to the experimental results, the probability of finding a feasible multicast tree by our MCMTS method is more than 99% if one exists. Furthermore, the MCMTS is also shown to be a simple and highly efficient method. As a result, it would be a practical approach for developing multicast routing protocol.

show abstract

“…Some of well-known Steiner tree heuristics are KBM [1] and BSMA [1]. methods based on neural networks and genetic algorithms [2] have also been proposed for computing low-cost multicast trees. As more and more bandwidth-delay-sensitive networking applications such as video conferencing, tele-education and many other distributed multimedia applications appear, efficient of low-cost multicast tree cause more satisfaction of users.…”

Section: Introductionmentioning

confidence: 99%