2004, 26(10): 1534-1539.
Abstract:
In the Optical Burst Switching (OBS) network, the data channel scheduling is one of key issues. Bandwidth efficiency and QoS support are the two concerned focuses. However, the existing algorithms pay more attentions to bandwidth efficiency. In this paper, BM-VF-SBD, an efficient data channel scheduling algorithm is developed. It effectively integrates void filling, burst migration and selective burst discard to reduce the bandwidth fragment and support QoS. Its basic idea is in that a new burst is scheduled by migrating some bursts to other channels if none of voids in any channels can accommodate it; otherwise repeating the above processes after selectively dropping some bursts. Meanwhile under the balanced binary search tree data structure, its computational complexity will be O((2w + 1) log w) at most, and be close to that of LAUC-VF and ODBR, In the proposed algorithm, burst migration plays a key role in the improvement of bandwidth efficiency while selective burst discard has great effects on the two sides. The simulation results show that it performs much better than LAUC-VF and ODBR in burst loss probability (overall or individual) and bandwidth fragment ratio.