Time complexity optimization of the Paull algorithm based on expandable data structure

Abstract

The throughput of Clos switch depends on the response time of devices and the computing time of rearranging when Clos network is blocked, so it is very important to reduce the time complexity of the rearranging algorithm. The Paull algorithm is used intensively as the rearranging algorithm of Clos network, in this paper we abandon the set matrix structure in the Paull algorithm, and instead, we improve the Paull algorithm according to employ the expandable data structure of adjacency list of figures. This solution reduces the time complexity significantly.