A optimal approach to group scheduling in optical burst switching networks

Abstract

Scheduling is one of the crucial activities in the optical burst switching network. When the control packet of a burst arrives at a core network node, relying on information contained in the control packet, such as burst arrival time and end time, a scheduling algorithm is invoked to find an available wavelength channel for scheduling the incoming burst. The primary goal of the scheduling algorithm is to arrange incoming bursts on wavelength channels to maximize bandwidth utilization and minimize burst loss. This paper proposes a scheduling algorithm called MF_GS to optimize the scheduling efficiency. The advantages of this new proposed algorithm have been affirmed through analysis and evaluations based on simulation results.