Deterministic batch scheduling algorithm for optimal channel utilization in optical burst switching networks

Abstract

Majority of the burst scheduling algorithms reviewed from the contemporary literature focused on the individual bursts. Only few scheduling algorithms schedule bursts in the form of batch or a group of bursts. Among the existing set of scheduling algorithms, process complexity is one of the key challenges envisaged by the researchers. In addition, the issues pertaining to burst loss taking place in the group formation is the other key challenge envisaged in the existing models. Predominantly the burst loss is resultant action of fixed timeslot process adapted in the formation of burst groups. In this manuscript, emphasis is on addressing the aforesaid shortcomings and henceforth, a contemporary batch scheduling of bursts over the optimal channels in an Optical Burst Switching (OBS) networks were proposed. This model aimed to avoid burst loss and for increasing channel's utilization in the instance of burst and channel group formation, the proposed model focuses on group's creation as hierarchies that enable incremental update. Batch level scheduling performs using our earlier contribution depicted as Best Fit Channel Allocation with Void Filling (BFCA-VF). Experimental analysis in the form of simulation results affirms the benefits of the proposed algorithm.