Share Email Print
cover

Proceedings Paper

WS scheduling algorithm in optical burst switching networks
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Optical burst switching (OBS) provides a feasible paradigm for IP over DWDM. And one of key issues in OBS is the fast and efficient scheduling of bursts with different QoS demands. In this paper, we propose a novel window-based scheduling (WS) algorithm, in which all bursts arriving in the window are scheduled together based on priority BORA. Therefore batching scheduling can achieve an optimized BORA efficiency and then the number of contention in OBS can be reduced largely, and simultaneously priority scheduling in the window can efficiently enhance QoS. Simulation results show that the proposed WS algorithm with the optimal parameters such as window and max-delay, compared with BORA, can achieve more than one order blocking probability reduction for high priority bursts and approximately 3.5% improvement in bandwidth utilization at 0.8 load.

Paper Details

Date Published: 8 February 2005
PDF: 7 pages
Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); doi: 10.1117/12.576268
Show Author Affiliations
Hongxiang Guo, Beijing Univ. of Posts and Telecommunications (China)
Zhou Lan, Beijing Univ. of Posts and Telecommunications (China)
Yanjun Li, Beijing Univ. of Posts and Telecommunications (China)
Jian Wu, Beijing Univ. of Posts and Telecommunications (China)
Jintong Lin, Beijing Univ. of Posts and Telecommunications (China)


Published in SPIE Proceedings Vol. 5626:
Network Architectures, Management, and Applications II
S. J. Ben Yoo; Gee-Kung Chang; Guangcheng Li; Kwok-wai Cheung, Editor(s)

© SPIE. Terms of Use
Back to Top