基于窗口的光突发交换调度算法  

Window-based schedule algorithm in optical burst switching networks

作　　者：郭宏翔[1] 蓝洲[1] 伍剑[1] 林金桐[1] 

机构地区：[1]北京邮电大学光通信与光波技术教育部重点实验室,北京100876

出　　处：《通信学报》2005年第5期99-105,共7页Journal on Communications

基　　金：国家"863"计划基金资助项目(2002AA122022)

摘　　要：针对光突发交换网(OBS)中的资源竞争和QoS支持等问题,提出了一种新型的基于窗口的调度算法。该算法利用边缘节点的电缓存,对调度窗口中的突发数据包进行批量BORA调度,可以有效地降低网络中发生资源竞争的概率;同时调度窗口中的优先级策略还可以进一步增强QoS。网络仿真结果表明,通过选择合适的调度窗口和最大允许时延,该调度算法在0.8的网络负载下使得高优先级突发数据包的阻塞率下降一个量级,信道利用率提高3.5%。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.

关 键 词：光纤通信 光突发交换 窗口调度算法 资源竞争 QOS 

分 类 号：TN929.11[电子电信—通信与信息系统]