针对扩张型Benes光交换芯片在未满配置情形下的问题,提出一种约束链路路由算法。该算法首先按照光开关的横向约束和子网连接关系对需要配置的光开关进行分组,然后通过优化光开关组合状态形成满足交换需求的链路路由,无需对其他空闲光开关进行任何处理,提高了光交换芯片的配置效率。以16×16扩张型Benes光交换网络为例,描述了约束链路路由算法的执行过程,并与其他配置路由算法进行比较。分析了芯片网络中当光开关失去切换功能或丧失通光功能时,该算法在提高芯片容错能力方面发挥的作用。

A constrained link routing algorithm is proposed to solve the problem of unconfigured dilated Benes optical switching chips. First, the algorithm groups the optical switches to be configured according to their lateral constraint and subnet connection relationship, and then it optimizes the optical switch combination state to form a link route that satisfies the switching requirement. In this manner, the configuration efficiency of optical switching chips is improved since no processing is required for other idle optical switches. Taking a 16×16 dilated Benes optical switching network as an example, the execution process of the constrained link routing algorithm is described and compared with other configuration routing algorithms. Furthermore, the role of the algorithm in improving the fault tolerance of a chip when its optical switch loses the switching or light-passing function in the chip network is analyzed.