| 光网络中分离路由算法的研究 |
| |
| 引用本文： | 钟磊,范红.光网络中分离路由算法的研究[J].光通信研究,2007,33(6):8-10,33. |
| |
| 作者姓名： | 钟磊 范红 |
| |
| 作者单位： | 南京邮电大学,光电工程学院,江苏,南京,210003 |
| |
| 摘 要： | 光网络比传统的包含节点、链路的图论网络更为复杂,使用分离路径能够有效地改善光网络的可靠性.文章提出了一种基于改进蚁群算法的分离路由算法,通过与最短路径优先算法进行仿真比较可知,该算法在多条分离路径的搜索上具有较明显的优势.
|
| 关 键 词： | 分离路由 蚁群算法 最短路径优先算法 |
| 文章编号： | 1005-8788（2007）06-0008-03 |
| 收稿时间： | 2007-06-30 |
| 修稿时间： | 2007年6月30日 |
Study on a disjoint routing algorithm in optical networks |
| |
| Zhong Lei,Fan Hong.Study on a disjoint routing algorithm in optical networks[J].Study on Optical Communications,2007,33(6):8-10,33. |
| |
| Authors: | Zhong Lei Fan Hong |
| |
| Abstract: | 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. |
| |
| Keywords: | disjoint route ant algorithm shortest path first algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
