A novel algorithm for multimedia multicast routing in a large scale network

Tsai, Cheng-Fa; Tsai, Chun-Wei; Chen, Chi-Pin

doi:10.1016/s0164-1212(03)00096-7

Cited by 18 publications

(21 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have used the chromosome representation as in Hwang et al 2000;Tsai et al 2004;Vijayalakshmi and Radhakrishnan 2008. For a given source node and set of destinations {v 1 , v 2 , v 3 ,…,v k }, chromosome is represented as in Fig.…”

Section: Chromosome Representation and Routing Table Relationmentioning

confidence: 99%

A novel hybrid immune-based GA for dynamic routing to multiple destinations for overlay networks

Vijayalakshmi¹,

Radhakrishnan

2009

Soft Comput

View full text Add to dashboard Cite

Overlay networks play an important role in group communication applications in Internet. These applications require better efficiency in terms of delay, cost and load balancing. This paper presents an artificial immune system (AIS)-based hybrid genetic algorithm for the construction of Quality of Service (QoS) multicast tree among multicast service nodes in overlay network which optimizes path delivery, load-balancing variance and cost under bounded delay-degree constraint. This paper proposes an alternative AIS-based approach to handle the constraints instead of penalty function in overlay multicast routing problem. The clonal selection method of AIS is incorporated into the genetic algorithm (GA) to improve the diversity-convergence relationship which leads to optimized results. Proposed algorithm has the following features: (1) embedded problem specific local search function along with random point crossover to fine tune the search; (2) AIS principle is used to solve the constraints in GA; (3) clonal selection method to get the optimized results. Adaptable procedure is embedded into algorithm to handle the end user join/end user drop. Non-parametric statistical analysis has performed to show the significant difference among the proposed and existing algorithms. Simulation results reveal that our proposed algorithm produces better results in terms of cost, average path length, user rejection rate and convergence. Statistical analysis is also performed to assure the significance of the differences among the tested algorithms.

show abstract

Section: Chromosome Representation and Routing Table Relationmentioning

confidence: 99%

A novel hybrid immune-based GA for dynamic routing to multiple destinations for overlay networks

Vijayalakshmi¹,

Radhakrishnan

2009

Soft Comput

View full text Add to dashboard Cite

show abstract

“…Recently, GAs were used to find the multicast routing so as to reduce the total cost from the multicast delivery tree. Examples are the multimedia multicast routing [25,26], WDM multicast network routing [27,28], QoS-based multicast routing [28][29][30], WDM ring multicast [31], WDM anycast [32], group multicast [33], and others related to Steiner trees. In [28], authors considered the problem of minimizing the number of split-capable nodes in the network for a given set of multicast requests.…”

Section: Ga-based Approaches In Multicast Routingmentioning

confidence: 99%

Genetic Algorithm for Finding Minimal Cost Light Forest of Multicast Routing on WDM Networks

Din

2008

Journal of Artificial Evolution and Applications

View full text Add to dashboard Cite

Wavelength division multiplexing (WDM)is an important technique to make use of the large amount of bandwidth in optical fibers to meet the bandwidth requirements of applications. Multicast is the transmission of information from one source to multiple destinations simultaneously. Given a multicast request in a WDM network, the goal is to find a set of light trees, the assigned wavelengths of light trees, and construct a light forest. In this paper, the minimal cost multicast routing problem (MCMRP) on WDM networks with tap-and-continue (TaC) nodes is defined and studied. A new cost model which consists of the wavelength usage and communication cost is defined. The objective is to minimize the sum of the cost of used wavelengths and the communication cost of the light forest. Specifically, the formulation for the WDM multicast routing problem is given. Because the MCMRP is NP-hard, two genetic algorithms (GAs) are proposed to solve this problem. In the proposed GAs, a path-oriented encoding chromosome is used to represent the routing paths. These routing paths are used to construct source-based light forests to represent a feasible solution to the multicast request. Moreover, to speed up the convergence of GAs, a farthest-first greedy heuristic algorithm is proposed and used to generate one of the initial chromosomes. Simulation results demonstrate that the proposed GAs can run efficiently.

show abstract

“…Examples are the multimedia multicast routing (Zhang and Leung 1999;Tsai et al 2004), WDM multicast network routing (Chen and Tseng 2005;Siregar et al 2005), QoS-based multicast routing (Siregar et al 2005;Haghighat et al 2003;Roy and Das 2004), WDM ring multicast (Din 2004), WDM anycast (Din 2007), group multicast (Randaccio and Atzori 2007) and others related to Steiner trees. In Siregar et al (2005), authors considered the problem of minimizing the number of split-capable nodes in the network for a given set of multicast requests.…”

Section: Ga-based Approaches In Multicast Routingmentioning

confidence: 99%

Genetic algorithm for finding minimal cost light-forest of multicast routing on WDM networks

Din

2008

Artif Intell Rev

View full text Add to dashboard Cite

Wavelength division multiplexing (WDM) is an important technique to make use of the large amount of bandwidth in optical fibers to meet the bandwidth requirements of applications. Multicast is the transmission of information from one source to multiple destinations simultaneously. Given a multicast request in a WDM network, the goal is to find a set of light-trees, the assigned wavelengths of light-trees, and construct a light-forest. In this paper, the Minimal cost multicast routing problem (MCMRP) on WDM networks with Tap-and-continue nodes is defined and studied. A new cost model which consists of thewavelength usage and communication cost is defined. The objective is to minimize the sum of the cost of used wavelengths and the communication cost of the light-forest. Specifically, the formulation for the WDM multicast routing problem is given. Because the MCMRP is NP-hard, two genetic algorithms (GAs) are proposed to solve this problem. In the proposed GAs, a path-oriented encoding chromosome is used to represent the routing paths. These routing paths are used to construct source-based light-forests to represent a feasible solution to the multicast request. Moreover, to speed up the convergence of GAs, a Farthest-first greedy heuristic algorithm is proposed and used to generate one of the initial chromosomes. Simulation results demonstrate that the proposed GAs can run efficiently.

show abstract

A novel algorithm for multimedia multicast routing in a large scale network

Cited by 18 publications

References 7 publications

A novel hybrid immune-based GA for dynamic routing to multiple destinations for overlay networks

A novel hybrid immune-based GA for dynamic routing to multiple destinations for overlay networks

Genetic Algorithm for Finding Minimal Cost Light Forest of Multicast Routing on WDM Networks

Genetic algorithm for finding minimal cost light-forest of multicast routing on WDM networks

Contact Info

Product

Resources

About