A data channel scheduling algorithm based on burst migration for optical burst switching networks

Abstract

Currently optical burst switching (OBS) has been regarded as the most promising backbone networking technology for the next-generation Internet. In the OBS network, the data channel scheduling is one of key problems. Bandwidth efficiency and QoS support are its two concern focuses. However, the existing algorithms pay more attention to bandwidth efficiency. In this paper, we develop an efficient data channel scheduling algorithm, called BM-VF-SBD . It effectively integrates several mechanisms (i.e., 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 an effective data structure, such as the balanced binary search tree, its computational complexity will be o [(2 w +1) log w ] at most, and be close to 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.