【作者】 黄小珂；

【导师】 龚跃；

【作者基本信息】 长春理工大学 ， 计算机应用技术， 2010， 硕士

【摘要】 随着当前网络所要处理的实时业务的不断增多,网络能够提供的服务质量问题越来越多地受到人们的关注。路由问题作为网络数据传输的重要方面,它性能的好坏直接关系到整个网络的性能。对于包含延迟、延迟抖动、带宽、丢包率和最小花费等约束条件在内的服务质量(QoS)路由问题的研究逐渐成为网络技术研究领域需要探索的主要方向。目前,对于QoS路由问题主要采用如蚁群算法等的启发式算法进行求解。蚁群算法以其优良的适应性,较强的可移植性,本质并行性,易于与其它算法结合等优点在解决各种复杂的NP完全问题方面挥发了重要作用。论文通过对基本蚁群算法的深入研究,提出了一种改进的动态自适应蚁群算法(DAAO),并对如何应用它来解决QoS组播路由问题做出了详尽的分析和设计,最后通过将真实的网络拓扑结构抽象成无向带权连通图,对问题的求解过程进行了仿真。仿真结果表明该算法能够正确、有效的求解QoS路由问题。更多还原

【Abstract】 In the current network, with the increase of real-time business which needs to be deal with, network quality of service problems are concerned increasingly. As an important aspect of network data transmission, routing problem is directly related to overall network. Good routing can improve the performance of network, and vice versa. The study of quality of service (QoS) routing problem that include of delay, delay jitter, bandwidth, packet loss rate and minimum cost and other constraints, has becomes the main direction of network technology research. At present, mainly use the heuristic algorithm, thus as ant colony algorithm to solve the QoS routing problem. Ant colony algorithm play an important role in solving complex NP-complete problems by it’s the advantages of excellent adaptability, strong portability, the nature of parallelism, easy-to-combining with other algorithms.In this paper, I proposed an algorithm named dynamic self-adaptive ant colony algorithm (DAAO) by in-depth study of basic ant colony algorithm, and the article has made a detailed analysis and design on how to use it to solve the QoS multicast routing problem, and simulated the problem solving process by abstracted the real network topology into a weighted undirected connected graph. The simulation results show that the algorithm is correct, and effective for solving QoS routing problem.更多还原