Finding a Multicast Routing Tree Based on QoS Constraint Using a Genetic Algorithm with Fuzzy Selection and Local Search

• Main Authors: Chuen-chieh Liao, 廖俊傑
• Other Authors: Rung-ching Chen
• Format: Others
• Language: en_US
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/u9dr46

碩士 === 朝陽科技大學 === 資訊管理系碩士班 === 93 === Most of network based on Fiber constructed as a middle-ware from a source node to destination nodes, the fiber supplies a huge of high-speed network. Therefore, many of new communication applications have emerged, such as distribution systems, on-line video-services, and some other applications. These services must ensure stable QoS (Quality of Service) and provide acceptable link costs, time delay, bandwidth, and packet loss constraints, essentially a multicast routing problem. In multicast routing problems, to construct the least-cost multicast routing tree under QoS constraints is an NP-complete problem. In this thesis, we propose a genetic algorithm using fuzzy selection with local search (GFLS) method to meet the problem of QoS under delay constraints. We use GFLS algorithm to find a multicast tree with minimum cost under delay constraints. The simulation results demonstrate that the GFLS can efficiently solve a multicast routing problem under QoS constraints