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 attentions 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 filliing, 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((2w+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.
This work is supported by National Natural Science Foundation of China (No.90304004), National Hi-tech Research and Development Program of China (863 Program) (No.2003AA121540), the Ministry of Education (No. 204125), the Education Council of Chongqing (No. 050309), and the Science and Technology Council of Chongqing (No. 8061)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Verma, S., Chaskar, H., Ravikanth, R.: Optical burst switching: A viable solution for terabit IP backbone. IEEE Network 14(6), 48–53 (2000)
Xu, L., Perros, H., Rouskas, G.: Techniques for optical packet switching and optical burst switching. IEEE Communications Magazine 39(1), 136–142 (2001)
Turner, J.: Terabit burst switching. Journal High Speed Networks 8(1), 3–16 (1999)
Xiong, Y., Vandenhoute, M., Cankaya, H.: Control architecture in optical burst-switched WDM networks. IEEE Journal on Selected Areas in Communications 18(10), 1838–1851 (2000)
Yang, X., Dang, M., Mao, Y., Li, L.: A new burst assembly technique for supporting QoS in optical burst switching networks. To appear in Chinese Optics Letters 1(5) (May 2003)
Yu, X., Chen, Y., Qiao, C.: A Study of Traffic Statistics of Assembled Burst Traffic in Optical Burst Switched Networks. In: Proc. of SPIE Opticomm 2002, Boston, USA, July 2002, vol. 4874, pp. 149–159 (2002)
Tan, S.K., Mohan, G., Chua, K.C.: Algorithms for burst rescheduling in WDM optical burst switching networks. Computer Networks 41(1), 41–55 (2003)
Iizuka, M., Sakuta, M., Nishino, Y., Sasase, I.: A scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network. In: Proc. of IEEE Globecom 2002, Taipei, Taiwan, November 2002, vol. 3, pp. 2736–2740 (2002)
Vokkarane, V.M., Thodime, G., Challagulla, V., Jue, J.P.: Channel scheduling algorithms using burst segmentation and FDLs for optical burst-switched networks. In: Proc. of IEEE ICC 2003, Anchorage, USA (May 2003)
Xu, J., Qiao, C., Li, J., Xu, G.: Efficient channel scheduling algorithms in optical burst switched networks. In: Proc. of IEEE INFOCOM 2003, San Francisco, USA, April 2003, vol. 4, pp. 2363–2367 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, X., Zhang, D., Chen, Q., Long, K., Ji, L. (2004). BM-VF-SBD: An Efficient Data Channel Scheduling Algorithm to Support QoS for Optical Burst Switching Networks. In: Chi, CH., Lam, KY. (eds) Content Computing. AWCC 2004. Lecture Notes in Computer Science, vol 3309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30483-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-30483-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23898-0
Online ISBN: 978-3-540-30483-8
eBook Packages: Springer Book Archive