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.
목차
Abstract 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
키워드
Quality of ServiceMulticast routingGenetic algorithmSimulated annealing algorithm
저자
Bo Peng [ Graduate School of Engineering, Hosei University ]
Lei Li [ Graduate School of Engineering, Hosei University ]
보안공학연구지원센터(IJFGCN) [Science & Engineering Research Support Center, Republic of Korea(IJFGCN)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Future Generation Communication and Networking
간기
격월간
pISSN
2233-7857
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Future Generation Communication and Networking Vol.5 No.1