On the routing algorithms for optical Multi-log2N networks

Multi-log(2) N networks architecture is attractive for constructing optical switches, and the related routing algorithms are critical for the operation and efficiency of such switches. Although several routing algorithms have been proposed for multi-log(2) N networks, a full performance comparison among them is not available by now. Thus, this paper is committed to such a comparison in terms of blocking probability, time complexity, hardware cost and load balancing capability. Notice that the load balance is important for reducing the peak power requirement of a switch, so we also propose in this paper two new routing algorithms for optical multi-log(2) N networks to achieve a better load balance.