Abstract-Group scheduling is a scheduling operation of optical burst switching networks in which the burst header packets arriving in each timeslot will schedule their following bursts simultaneously. There have been many proposals for group scheduling (such as OBS-GS, MWIS-OS and LGS), but they consider mainly to schedule the arriving bursts which have the same wavelength on an output data channel. Another suggestion is GreedyOPT which considers the group scheduling for multichannel with the support of full wavelength converters, but it is not optimal. This article proposes another approach of group scheduling which is more optimal and has a linear complexity.
Group scheduling is an operation whereby control packets arriving in a time slot schedule their bursts simultaneously. Normally, those bursts that are of the same wavelength are scheduled on the same channel. In cases where the support of full wavelength converters is available, such scheduling can be performed on multiple channels for those bursts that are of an arbitrary wavelength. This paper presents a new algorithm for group scheduling on multiple channels. In our approach, to reach a near‐optimal schedule, a maximum‐weight clique needs to be determined; thus, we propose an additional algorithm for this purpose. Analysis and simulation results indicate that an optimal schedule is almost attainable, while the complexity of computation and that of implementation are reduced.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.