摘要
提出了两种基于数据信道空闲间隔长度的OBS网络数据信道调度算法,它根据当前数据信道空闲间隔长度大小的情况选择LAUC或者LAUC-VF算法来调度新到的数据突发包,在最小化信道空闲间隔的同时减小了光突发数据包的调度时间。仿真结果表明,基于空闲间隔长度的调度算法在调度时间方面与已有的LAUC算法很接近;而在光突发数据包丢失率性能方面要优于LAUC-VF算法。
Two data channel scheduling algorithm based on void interval length is proposed for Optical Burst Switching （OBS） networks. Whether Latest Available Unscheduled Channel （LAUC） or Latest Available Unscheduled Channel with Void Filling （LAUC-VF） is selected to schedule an arriving burst is decided by a threshold which is set according to the current void interval of data channel. If the length of the arriving data burst is less than the threshold, the LAUC-VF algorithm is selected; otherwise the LAUC algorithm is selected. The proposed algorithm reduces scheduling time of data burst while minimizing void interval of data channel. Simulation results show that the scheduling time of the proposed algorithm is close to LAUC, and the performance of data burst loss probability is better than LAUC-VF.
出处
《光电工程》
EI
CAS
CSCD
北大核心
2006年第8期55-59,共5页
Opto-Electronic Engineering
基金
国家863项目
国家自然科学基金项目(90304004)
国家教育部新世纪优秀人才支持计划(教技司[2005]2号)
重庆市科委项目(2005BB2062
2005AC2089)
重庆市教委项目(KJ060508
KJ060513)
重庆邮电大学青年基金项目(A2005-28)
关键词
光突发交换
调度算法
LAUC
LAUC-VF
Optical burst switching
Scheduling algorithm
Latest available unscheduled channel
Latest available unscheduled channel with void filling
