A Study of Ant Colony System Design for Multicast Routing


The KIPS Transactions:PartA, Vol. 10, No. 4, pp. 369-374, Oct. 2003
10.3745/KIPSTA.2003.10.4.369,   PDF Download:

Abstract

Ant Algorithm is used to find the solution of Combinatorial Optimization Problems. Real ants are capable of finding the shortest path from a food source to their nest without using visual informations. This behavior of real ants has inspired ant algorithm. There are various versions of Ant Algorithm. Ant Colony System (ACS) is introduced lately. ACS is applied to the Traveling Salesman Problem (TSP) for verifing the availability of ACS and evaluating the performance of ACS. ACS find a good solution for TSP. When ACS is applied to different Combinatorial Optimization Problems, ACS uses the same parameters and strategies that were used for TSP. In this paper, ACS is applied to the Multicast Routing Problem. This Problem is to find the paths from a source to all destination nodes. This definition differs from that of TSP and differs from finding paths which are the shortest paths from source node to each destination nodes. We introduce parameters and strategies of ACS for Multicasting Routing Problem.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. S. Geun and H. C. Geun, "A Study of Ant Colony System Design for Multicast Routing," The KIPS Transactions:PartA, vol. 10, no. 4, pp. 369-374, 2003. DOI: 10.3745/KIPSTA.2003.10.4.369.

[ACM Style]
Lee Seong Geun and Han Chi Geun. 2003. A Study of Ant Colony System Design for Multicast Routing. The KIPS Transactions:PartA, 10, 4, (2003), 369-374. DOI: 10.3745/KIPSTA.2003.10.4.369.