Routing algorithm for vertically stacked optical banyan networks with the time complexity O(N) using pipelined processors

Centralized control routing algorithm for optical banyan networks on vertical stacking scheme has time complexity O(Nlog₂N) for rearrangebly nonblocking structure. A distributed algorithm with O(log₂N) has been recently proposed in which authors have considered an N completely connected processors to take routing decision which practically would be very difficult to implement for large N. In this paper we have proposed a distributed routing algorithm with processors work in pipelined fashion and take the routing decision in linear time. Also they do not need to be completely connected which makes it more practical for implementation.