摘要
在研究新型蚂蚁算法理论的基础上,进一步对新型蚂蚁算法的时间复杂性与鲁棒性进行实际计算与研究,研究出蚂蚁移动Mlog2N(M为边数,N为结点数)步后,能找到QoSR的较优解,该算法的时间复杂性为O(MNlog2N).对该算法的鲁棒性进行分析,证实了在关键结点失效后,该算法仍能找到新的QoSR,并发现随着关键结点失效增多,再找到新的QoSR的QoS参数值急剧下降.
This paper studies time complexity and robustness of the algorithm by actual computing. The result is that the algorithm can find out the QoSR excellent solution after the ant move Mlog2N （M= side number, N= node number） steps. Time complexity of the algorithm is O（MNIog2N）. About robustness of the algorithm, the result substantiate that the new ant algorithm can still find out a new QoSR after the key node is failure. The results show that the performance of QoSR become worse with increase of the key node failure.
出处
《武汉理工大学学报（交通科学与工程版）》
2006年第2期365-368,共4页
Journal of Wuhan University of Technology（Transportation Science & Engineering）
基金
TheworkissupportedbytheNationalNaturalSciencefoundation(Grant90304018)andWuhanproject(2004/00/00/)ofchina
关键词
计算机网络
QOSR
新型蚂蚁算法
computer network
quality of service routing
new ant algorithms
