摘要： 提出了一种新的耐故障Clos网，通过在基础Clos网各段中增加冗余的交换单元，使其能够在发生少量故障的情况下正常工作，从而提供更可靠的服务。针对耐故障Clos网，给出一种耐故障Clos路由算法，该算法采用最小分布优先的策略逐列计算Clos网连接说明矩阵，通过重排完全实现无阻塞路由，该算法的时间复杂度在最坏情况下仅为O(N3/2)。该耐故障Clos网及其算法设计可以用于实现更为可靠的Clos网络。

关键词: Clos网, 耐故障, 路由算法

Abstract: The paper introduces a new fault-tolerant Clos network. By adding extra switches in each stage of it, the Clos network can maintain its performance and provide reliable services under few faults. The paper also presents a fault-tolerant routing algorithm for fault-tolerant Clos network. This algorithm uses a minimum distribution priority scheme handling Clos specification matrix column by column and completely achieves rearrangeable non-blocking routing. The fault-tolerant routing algorithm can reach a low time complexity O(N3/2) even in the worst case. The design of fault-tolerant Clos network and its algorithm is readily applicable to more reliable Clos network.

Key words: Clos network, fault-tolerant, routing algorithm

中图分类号: 

• TP393