Scheduling Bursts in Time-Domain Wavelength Interleaved Networks

We consider the problem of scheduling bursts of data in an optical network with an ultra-fast tunable laser and a fixed receiver at each node...We formulate the scheduling problem as a generalization of the well-known crossbar switch scheduling. We prove that even in the presence of propagation delays, there exist a class of computationally viable scheduling algorithms which asymptotically achieve the maximum throughput that can be achieved without propagation delays.