Determination of rearrangement cost for optical networks

During the path establishment, states of switching elements in the switch network may need rearrangement. C.-T. Lea et. al [1] has first mentioned about the rearrangement behavior of the switching networks. He has analyzed the frequency of its occurrence using stochastic method. It is notable that rearrangement behavior of switching network includes rearrangement of connections and rearrangement of switching elements. Optimization of rearrangement cost of switching network can save both power and time, which in turn can increase the switching speed. This paper determines the rearrangement cost of strictly non-blocking Vertically Stacked Optical Banyan networks in terms of switching elements. We believe that our result will be helpful in designing, implementing and analyzing different algorithms of the networks.