Window-based schedule algorithm in optical burst switching networks
Lin Jin-tong · Journal of China Institute of Communications · 2005
For the fast and efficient scheduling of bursts with diverse QoS demands in optical burst switching (OBS) networks, a novel window-based schedule algorithm (WS) was proposed, in which all bursts arriving in a window were scheduled together based on priority BORA algorithm. Therefore the batching scheduling could achieve an optimized BORA efficiency and then contention in OBS could be reduced largely, and simultaneously the priority policy in the window could efficiently enhance QoS. Simulation results show that WS algorithm with optimal parameters such as window and max delay can achieve more than one order blocking probability reduction for high priority bursts and approximately 3. 5% improvement in channel utilization at 0.8 load.