A Degree-Delay-Constrained Genetic Algorithm for Multicast Routing Tree

Authors:
Lin Chen;ZhiYun Yang;ZhengQuan Xu
Affiliations:
Wuhan University and Yangtze University;Wuhan University;Wuhan University
Venue:
CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
Year:
2004

Citing 0
Cited 7

An enhanced QoS CBT multicast routing protocol based on Genetic Algorithm in a hybrid HAP-Satellite system

Computer Communications
Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints

Expert Systems with Applications: An International Journal
Artificial immune based hybrid GA for QoS based multicast routing in large scale networks (AISMR)

Computer Communications
Genetic algorithm for delay- and degree-constrained multimedia broadcasting on overlay networks

Computer Communications
A two-stage genetic algorithm for the multi-multicast routing

ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
Hybridized optimization genetic algorithm for QOS-based multicast routing problem

ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
A genetic-inspired multicast routing optimization algorithm with bandwidth and end-to-end delay constraints

ICONIP'06 Proceedings of the 13th international conference on Neural information processing - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to the advent of many new multimedia applications that have QoS (Quality of Service) requiremenst in high-speed networks, the issue of multicast routing has become more and more important. The multicast routing problem is also known as the Steiner Tree Problem which has been shown to be NP-complete. Previous research works just take delay, delay jitter, loss rate, bandwidth and cost into consideration and not view multicasting ability of router as a constrained factor. Limiting degree of switch or router can save information delivering/copying time and keep load balance. Delay-constrained is a crucial factor in QoS. This paper takes delay and also degree constraints into account and proposes a new multicast routing algorithm based on genetic algorithm (GA) to construct Degree-Delay Constrained least-cost multicast routing Tree (DDCT). Algorithms adopt pr ..fer coding and decoding which is very suitable for crossover and mutation operation and can save runtime, pruning and grafting techniques are employed to adjust node degree and repair tree structure. Two repairing tree structure methods are proposed and named as DDCT1 and DDCT2. Simulations were conducted on a random graph to evaluate the performance of the proposed algorithm. Experimental result shows proposed algorithms perform well than other similar multicasting algorithm such as CSPT and Wang_GA.