A Novel Genetic Algorithm for Multicast Routing Problem on the QoS Constrain

New technologies are continuously being applied to high-speed networks such as distribution systems, on-line video-services, and some other applications. These services must ensure stable QoS (quality of service) and provide acceptable link costs, time delay, bandwidth and pack loss constraints, ess...

Full description

Saved in:

Bibliographic Details
Published in:	2006 IEEE International Conference on Systems, Man and Cybernetics Vol. 3; pp. 1939 - 1944
Main Authors:	Rung-Ching Chen, Chuen-Chieh Liao, Pan, B.R.-H., Lin-Yu Tseng
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01-10-2006
Subjects:	Biological cells Chaos Costs Encoding Genetic algorithms High-speed networks Neural networks NP-complete problem Quality of service Routing
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	New technologies are continuously being applied to high-speed networks such as distribution systems, on-line video-services, and some other applications. These services must ensure stable QoS (quality of service) and provide acceptable link costs, time delay, bandwidth and pack loss constraints, essentially a multicast routing problem. Computing such multicast routing problems is an NP-complete problem. In this paper, we propose a genetic algorithm using fuzzy selection (GFS) to address the problem of QoS under delay constraints. The GFS algorithm finds a multicast tree with minimum cost under delay constraints..
ISBN:	1424400996 9781424400997
ISSN:	1062-922X 2577-1655
DOI:	10.1109/ICSMC.2006.385014