A novel composite scheduling algorithm for OBS switch with shared optical buffer

In this paper, the conservative mode and the greedy mode scheduling algorithms for optical burst switch with shared optical buffer are presented and discussed. Computer simulations compare their performance as well as that of greedy mode with void filling algorithm. Results show that the conservative mode and the greedy mode have different characteristics under light and heavy load. Because of their lower computational complexity and FIFO characteristics, the greedy mode and conservative mode scheduling algorithms are more applicable in a real system than the void filling algorithm. Finally, a composite algorithm integrated by the conservative mode and the greedy mode is proposed, which is adapted to the input load with the help of a simple load monitor. The simulation result approaches that it has favorable performance under different input load.