earticle

영어

Scheduling plays a very important role in effective communication in optical burst switching networks. Thus far, many different scheduling algorithms have been proposed; these can be classified into two main groups: online scheduling and group scheduling. In case of the latter, some algorithms have been proposed as OBS-GS, which maximize the number of scheduled bursts, or MWIS-OS, the target of which is to obtain the maximum total length of the scheduled bursts. However, these proposals have the algorithm complexity of NP-complete. In this paper, we propose an algorithm of group scheduling that has linear complexity; the timeslot of group scheduling changes adaptively to the rate of the arriving bursts. The analysis and simulation results prove the correctness and the effectiveness of our proposal.