摘要
分析了传统光突发交换中的分组调度算法———LAUC算法的缺陷 ,提出了一种LAUC算法的改进算法(LAUC SV算法 ) ,采用自相似业务流模型对两种算法的性能进行了模拟仿真 ,结果表明在同等条件下LAUC SV算法下的丢包率比LAUC算法低 1 0 0 .5,且新算法下的丢包率关于光纤延时线单元时间的最佳窗口大大展宽 。
The disadvantages of LAUC algorithm in optical burst switch were analyzed. A LAUC SV algorithm was presented. The performance of the two algorithms under self similar traffic model was given and compared. The results showed that the burst loss ratio under the LAUC SV algorithm was 100.5 lower than LAUC algorithm, and the work window about unit time D of fiber delay lines was widened. The complexity of the algorithm was increased linearly compared with LAUC.
出处
《华中科技大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2004年第7期80-81,97,共3页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金
国家高技术研究发展计划资助项目 (2 0 0 2AA1 0 30 6 4 )
