Cart (Loading....) | Create Account
Close category search window
 

A multiobjective model for QoS multicast routing based on genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xunxue Cui ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China ; Chuang Lin ; Yaya Wei

Usually multiple quality of service (QoS) guarantees are required in most of multicast applications. In this paper, it is formulated as a multiobjective constrained combinatorial optimization problem for a protocol to determine multicast routes satisfying different QoS requirements. We use a multiobjective model and routing approach based on genetic algorithm that optimizes multiple QoS parameters simultaneously. The corresponding results demonstrate that the proposed approach is capable of discovering a set of nondominated routes within a finite evolutionary generation. Its feasibility and performance has been verified.

Published in:

Computer Networks and Mobile Computing, 2003. ICCNMC 2003. 2003 International Conference on

Date of Conference:

20-23 Oct. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.