论文部分内容阅读
网络服务质量路由是计算机网络理论研究的重要领域,QoSR问题是一个NP完全问题.蚂蚁算法在近几年内逐步得到推广和应用,文中在研究蚂蚁算法后,保留蚂蚁算法的信息素概念,提出了一种新型的蚂蚁算法,即蚂蚁在寻找路径时,放弃按概率的方式跳转结点的寻路方式,采用按信息素较少的路径跳转结点的寻路方式,以解决QoSR问题.通过实际编程和计算,该算法能均匀搜索每条路径,对于单个参数约束,能很快达到最优解,对于多个参数约束,能找到最优解.经过对该算法的分析,其时间复杂性与蚂蚁跳转结点的次数是线性关系.
Network quality of service routing is an important area of theoretical research on computer networks, and QoSR is an NP-complete problem.Ants have been gradually popularized and applied in recent years. After the study of ant algorithms, the concept of pheromone of ant algorithm is preserved, A new ant algorithm, that is, when ants look for paths, they abandon the path-seeking way of jumping nodes by probability and adopt the path-seeking way of path-hopping nodes with fewer pheromones to solve the QoSR problem. Through the actual programming and calculation, the algorithm can search each path uniformly, the optimal solution can be reached quickly for a single parameter constraint, and the optimal solution can be found for multiple parameter constraints.After the analysis of the algorithm, the time complexity The number of sexual and ant jump nodes is linear.