摘要
光网络比传统的包含节点、链路的图论网络更为复杂,使用分离路径能够有效地改善光网络的可靠性。文章提出了一种基于改进蚁群算法的分离路由算法,通过与最短路径优先算法进行仿真比较可知,该算法在多条分离路径的搜索上具有较明显的优势。
Optical networks are more complicated than the traditional graph-theoretic networks with nodes and links, but their reliability can be effectively improved by the use of disjoint paths. In this paper, we propose an improved ant-algorithm-based disjoint routing algorithm. Compared with the shortest path first algorithm, we find that this algorithm behaves much better in diverse path searches.
出处
《光通信研究》
北大核心
2007年第6期8-10,33,共4页
Study on Optical Communications
关键词
分离路由
蚁群算法
最短路径优先算法
disjoint route
ant algorithm
shortest path first algorithm
