Paper
8 February 2005 WS scheduling algorithm in optical burst switching networks
Author Affiliations +
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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hongxiang Guo, Zhou Lan, Yanjun Li, Jian Wu, and Jintong Lin "WS scheduling algorithm in optical burst switching networks", Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); https://doi.org/10.1117/12.576268
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Switching

Computer simulations

Optical networks

Algorithm development

Dense wavelength division multiplexing

Lithium

Networks

Back to Top