Distributed Control Routing Algorithms for Rearrangeably Nonblocking Optical Banyan Networks
Optical banyan networks can be made rearrangeably nonblocking using its multiple copies in unison. Such rearrangeably nonblocking networks are known as vertically stacked optical banyan (VSOB) networks. Centralized control routing algorithm for this rearrangeably nonblocking optical banyan networks has time complexity O ( N log2 N ). A distributed control routing algorithm with time complexity O (log2 N ) has been proposed recently in which authors have considered N completely connected processors to take routing decision which practically would be very difficult to implement for large N . In this paper we propose two distributed control routing algorithms where processors are loosely connected. In the first algorithm ) ( N O processors work in pipelined fashion, and take the routing decision in linear time. In the second algorithm N inputs synchronously hunt for a free route among ) ( N O copies of a banyan network using a look up table. This algorithm has time complexity ) ( N O . Also the processors do not need to be completely connected, which makes it more practical for implementation.