Performance Analysis of Scheduling Algorithms in Optical Burst Switching (OBS) Networks

OBS is an efficient paradigm that transporting traffic directly over optical links, and has received considerable attention. It seems a challenge to analyze scheduling problem. In this paper we model and analyze channel utilization performance of IAUC, OBS-GS and MWIS-OS algorithms. The scheduling is modeled as a random graph space on grouping scheduling basis. Performance comparison of the three scheduling algorithms is measured with the number of independent sets, maximum independent sets and weight maximum independent sets. The lower and upper bound of gain obtained by MWIS-OS are presented. Numerical results are shown as well.