光突发交换网络中一种基于LAUC的批调度算法  

Data-burst Batch-scheduling Algorithm Based on LAUC for Optical Burst Switching Networks

作　　者：黄胜[1] 隆克平[2] 阳小龙[2] 陈前斌[3] 

机构地区：[1]重庆大学通信工程学院,重庆400044 [2]电子科技大学光互联网及移动信息网络研究中心,四川成都610054 [3]重庆邮电大学光互联网及无线信息网络研究中心,重庆400065

出　　处：《半导体光电》2007年第3期399-402,405,共5页Semiconductor Optoelectronics

基　　金：国家"863"计划项目(2005AA122310);国家自然科学基金项目(90304004);教育部新世纪优秀人才支持计划项目(教技司[2005]2号);重庆市科委项目(2005BB2062;2005AC2089);重庆市教委项目(KJ060508;KJ060513)

摘　　要：为了降低突发丢失率和调度复杂度,提出了一种基于LAUC的批调度算法。该算法首先缓存多个突发控制包,当最大缓存时间到达时,根据突发到达顺序批调度处理缓存中的突发控制包,并采用LAUC算法来为突发预留信道资源。其优势在于:计算复杂度与LAUC一样低,因为它只增加了突发控制包缓存和改变了LAUC算法的调度顺序;突发丢失率比较低,仿真结果表明它的突发丢失率比LAUC算法要低,当最大缓存时间大于偏置时间的最大差值时,它的突发丢失率比LAUC-VF算法还要低。In order to decrease the burst dropping probability and computational complexity, a batching scheduling algorithm based on LAUC（BS-LAUC） is proposed. The algorithm at first buffers more than one burst control packets（BCP）, and then schedules the data bursts（DB） by LAUC with burst arrival order. Compared with LAUC algorithm, BS-LAUC only adds buffering and changes the scheduling order. So BS-LAUC is as simple as LAUC. And it has another merit of low burst dropping probability. Simulation results show that BS-LAUC not only outperforms LAUC in terms of burst dropping probability, but also outperforms LAUC-VF in the condition that the maximum buffer time is longer than the max difference of the offset time.

关 键 词：光突发交换 数据信道调度算法 LAUC 

分 类 号：TN915[电子电信—通信与信息系统]