Efficient channel-scheduling algorithm in optical burst switching architecture

This paper proposes to reorder data bursts before allocating channels, which outperforms the conventional channel scheduling algorithms in terms of the burst loss probability, significantly reducing the voids (unused time slots). The proposed channel scheduling algorithm works better when used with a non-degenerate fiber delay lines (FDLs) buffer.