A Composite Scheduling Approach for Burst Loss Minimization in Optical Burst Switched Networks

—In optical burst switched (OBS) networks, burstscheduling is one of the key issue, which affects the performanceof networks. Several, scheduling algorithms have been used,such as horizon and void lling based algorithms. Void llingalgorithms reduces burst loss, but it has more execution timeas compared to horizon algorithms. On the other hand, horizonalgorithms has less execution time, but account poor bandwidthutilization. To take advantages of both the algorithms, compositescheduling can be used. In composite scheduling algorithm, ata time one algorithm is selected based on the information ofcurrent voids interval of data channels. This approach increasesthe bandwidth utilization and decreases time complexity. Thenetwork performance in terms of burst losses is evaluated usingsimulation model. The simulation results shows that compositescheduling is more effective and has less burst dropping ascompared to individual scheduling algorithm contained in it.Also, it is observed that composite scheduling algorithm usingLAUC and Min-EVF performs better in terms of burst loss ascompared to rest of the composite scheduling algorithms.