Efficient Implementation of Scheduling Algorithms for Optical Burst/Packet Switching

Fast scheduling algorithms are needed to implement optical burst or packet switching using the wavelength and time domains for congestion resolution. Because of the very large bandwidth of the optical links the burst/packet arrival rate at the network nodes is very large and therefore the time required to performing the scheduling decisions must be limited to very low values. This paper suggests an original formulation of the scheduling problem and a consequent implementation that proves to be very efficient, with a cost as low as a few computational units.