A Composite Scheduling Approach for Burst Loss Minimization in Optical Burst Switched Networks
In Optical Burst Switched (OBS) networks, burst scheduling is one of the key issue, which affects the performance of networks. Several, scheduling algorithms have been used, such as horizon and void filling based algorithms. Void filling algorithms reduces burst loss, but it has more execution time as compared to horizon algorithms. On the other hand, horizon algorithms has less execution time, but account poor bandwidth utilization. To take advantages of both the algorithms, composite scheduling can be used. In composite scheduling algorithm, at a time one algorithm is selected based on the information of current voids interval of data channels.