CAJ | 학술논문

针对带宽、延时、延时抖动和包丢失率约束以及费用最小的多约束 QoS 路由问题，论文提出一种多约束 Qos组播路由算法。该算法结合遗传算法和蚁群算法的优势，将遗传算法和蚁群算法进行融合，对蚁群进行选择、交叉、变异等操作，扩大搜索空间，同时利用遗传算法的快速收敛特性，选取最优个体用于更新全局信息素，加快了算法收敛。仿真结果表明了该算法的有效性和可行性。
침대대관、연시、연시두동화포주실솔약속이급비용최소적다약속 QoS 로유문제，논문제출일충다약속 Qos조파로유산법。해산법결합유전산법화의군산법적우세，장유전산법화의군산법진행융합，대의군진행선택、교차、변이등조작，확대수색공간，동시이용유전산법적쾌속수렴특성，선취최우개체용우경신전국신식소，가쾌료산법수렴。방진결과표명료해산법적유효성화가행성。
To solve the least cost QoS multicast routing problem with Multiple Constrained of bandwidth ,delay ,delay jitter ,packet loss .A new way is proposed to combine the genetic algorithm and the ant colony algorithm ,this algorithm combines the advantages of genetic algorithm and ant colony algorithm ,based on ant colony of selection ,crossover and muta‐tion operations to expand the search space ,at the same time use the fast convergence property of genetic algorithm ,selecting the best individual to update global pheromone ,accelerate the algorithm convergence .The simulation results show that the algorithm is an effective and feasible multiple constrained QoS routing algorithm .