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

A heuristic ant algorithm for solving QoS multicast routing problem

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

4 Author(s)
Chao-Hsien Chu ; Sch. of Inf. Sci. & Tech., Pennsylvania State Univ., University Park, PA, USA ; Junhua Gu ; Xiang Dan Hou ; Qijun Gu

In this paper, we present an ant colony-based heuristic to solve QoS (quality of service) constrained multicast routing problems. Our algorithm considers multiple QoS metrics, such as bandwidth, delay, delay jitter and packet loss rate, to find the multicast tree that minimizes the total cost. We also explore the scalability of the ant algorithm. Our tests show that the algorithm can find optimal (or near-optimal) solutions quickly and that it has good scalability

Published in:

Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on  (Volume:2 )

Date of Conference:


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.