PERMUTATION ROUTING IN WAVELENGTH- ROUTED WRAPPED-AROUND SHUFFLE NETWORKS USING FEWER WAVELENGTHS

摘要

Optical networks based on wavelength division multiplexing (WDM) and wavelength routing are considered to be potential candidates for the next generation of wide area networks. One of the main issues in these networks is the development of efficient routing algorithms which require minimum number of wavelengths. In this paper, we focus on the permutation routing problem in WDM networks with the shuffle network topology. We present a routing algorithm in these networks which requires O(log~2 TV) wavelengths, where N is the number of nodes in the network, whereas the previous algorithm by Pankaj and Gallager requires O(log~3,N) wavelengths.