An Efficient Composite Scheduling Algorithm for Optical Burst Switching Networks

Optical burst switching (OBS) is a promising paradigm for the next generation Internet. Data channel scheduling algorithm is one of the key issues in OBS networks. In this paper, an efficient composite data channel scheduling algorithm is proposed, this algorithm select LAUC or LAUC-VF to schedule the arriving burst according to the current information of the void interval of the data channel. The algorithm reduces scheduling time of data burst while minimizing the void interval of the data channel. Simulation results show that the scheduling time of the proposed algorithm is close to LAUC, and the performance of data burst loss probability is better than LAUC-VF.