作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (8): 123-125. doi: 10.3969/j.issn.1000-3428.2008.08.042

• 网络与通信 • 上一篇    下一篇

光交换网络中的路由算法

刘勇军1,杨俊波2   

  1. (1. 四川托普信息技术职业学院计算机系,成都 611743;2. 四川大学电子信息学院,成都 610064)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-04-20 发布日期:2008-04-20

Routing Algorithm in Optical Switching Network

LIU Yong-jun1, YANG Jun-bo2   

  1. (1. Department of Computer, Sichuan TOP Vocational Institute of Information, Chengdu 611743; 2. School of Electronics Information, Sichuan University, Chengdu 610064)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-04-20 Published:2008-04-20

摘要: 对于一类对称的可重排的多级光交换网络,提出一种有效的路由算法,将输入输出信号终端数映射到光交换网络的中央级,得到2个交换组,通过交换组内对应终端数的交换,完成中央级输入输出端所映射终端数的排列,从而确定中央级节点开关状态。再同时向2个方向进行类似操作,可依次确定各级节点开关状态。该路由算法操作时间短,通过O(N)步即可完成路由确定,可以有效处理对称光交换网络的路由问题,对于利用光交换网络实现全光交换和排序具有一定应用价值。

关键词: 光通信, 光交换, 路由算法, 交换网络

Abstract: An effective routing algorithm is presented for the multi-stage rearrangeable optical switching network. The input and output terminal numbers are mapped into the center stages, then two interchangeable groups which can exchange corresponding terminal numbers are obtained. Furthermore, the algorithm rearranges the sequence of input and output terminal numbers in the interchangeable groups, consequently, ascertains the status of center node switch. The next step is to route the network in a bi-directional way and determine similarly the status of the remaining stages in both sides. This algorithm runs very fast and effective because of routing the network in a bi-directional way, so only requires O(N) routing steps. It is proved that this algorithm can be implemented in optical interconnection networks for optical switching and permutation.

Key words: optical communication, optical switching, routing algorithm, switching network

中图分类号: