Optimum transmission scheduling in optical broadcast networks

The paper considers the problem of scheduling packet transmissions in a wavelength division multiplexed (WDM) optical network with a broadcast star topology. The transmitters are tunable with an associated tuning delay, and the receivers are fixed-tuned to one of the available wavelengths. The authors first consider the problem of scheduling all-to-all packet transmissions and show that the upper bound obtained by Pieris and Sasaki (1994) through an algorithm is also a lower bound for the minimum length schedule. They then extend the analysis to the general problem of arbitrary traffic demands and obtain tight upper and lower bounds for the schedule length