Performance Evaluation of Channel Scheduling Algorithms With Different QoS Classes

This paper compares the performance of different schedulingalgorithms, with and without void filling, considering a completeOptical Burst Switched (OBS) network scenario, given by edge andcore routers, under real traffic conditions.Performance is investigated taking into account both burst lossprobability and the complexity of the algorithms, evaluated interms of scheduling time. For an effective comparison both aspectshave to be considered in order to understand if an algorithm whichprovides low burst blocking probabilities is actually feasible ornot.In this paper the authors propose a scheduling algorithm whichrepresents a good trade-off between burst blocking performance andscheduling time.