Performance Evaluation of Channel Scheduling Algorithms with Different QoS Classes

This paper compares the performance of different scheduling algorithms, with and without void filling, considering a complete Optical Burst Switched (OBS) network scenario, given by edge and core routers, under real traffic conditions. Performance is investigated taking into account both burst loss probability and the complexity of the algorithms, evaluated in terms of scheduling time. For an effective comparison both aspects have to be considered in order to understand if an algorithm which provides low burst blocking probabilities is actually feasible or not. In this paper the authors propose a scheduling algorithm which represents a good trade-off between burst blocking performance and scheduling time.