http://tracker.cse.buffalo.edu/Ticket/Display.html?id=10606 Comments: The file is on hadar ContactPerson: hungngo@cse.buffalo.edu Remote host: saigon.cse.buffalo.edu ### Begin Citation ### Do not delete this line ### %R 2002-10 %U /home/csefaculty/hungngo/public_html/papers/ngo-2002-3.ps %A Ngo, Hung Q. %T WDM Split Cross-connects and $3$-stage Clos Networks %D July 09, 2002 %I Department of Computer Science and Engineering, SUNY Buffalo %K WDM split cross-connects, Clos Networks, Routing Algorithms %X In this paper, we first show that a wavelength division multiplexed (WDM) split cross-connect is strictly, wide-sense, or rearrangeably non-blocking if and only if a corresponding $3$-stage Clos network is strictly, wide-sense or rearrangeably non-blocking. This observation implies known results on strictly non-blocking WDM split cross-connects and gives rise to new results on wide-sense and rearrangeably non-blocking WDM split cross-connects. We next introduce a routing algorithm for the Clos networks which show that there are wide-sense non-blocking Clos networks which are not strictly non-blocking. Hence, the same holds for the WDM split cross-connects. We also consider another demand model for WDM split cross-connects and present associated results. Routing algorithms for WDM split cross-connects could be viewed as on-line and off-line algorithms to edge-color a class of bipartite multi-graphs.