원문정보
초록
영어
With the increasing demand of multimedia applications, efficient and effective support of quality of service (QoS) has become more and more essential. A multicast communication creates a distribution tree structure, on which a multicast source sends a single copy of data to a group of receivers instead of sending a separate copy of the data to each receiver as in a unicast communication. In this paper, we study the bandwidth, delay, delay jitter, and packet loss ratio constrained least-cost multicast routing problem which is known to be NP-complete, and present an adaptive genetic simulated annealing algorithm (AGSAA) to solve the QoS multicast routing problem. The simulation results show that this algorithm has fast convergence and excellent cost performance.
목차
1. Introduction
2. Problem Description and Formulation
3. Genetic Algorithm
4. Simulated Annealing Method
5. The Proposed AGSAA Algorithm
5.1. Pre-processing Phase
5.2. Initial Population
5.3. Fitness Function
5.4. Selection
5.5 Crossover and Mutation Operation with Adaptive Probability
5.6 Simulated Annealing Algorithm
6. Simulations and Discussions
7. Conclusion
Acknowledgements
REFERENCES