OBS网络数据信道调度算法性能比较

Comparison of Data Channel Scheduling Algorithms for OBS Networks

在光突发交换OBS(Optical Burst Switching)网络的数据信道调度算法的性能分析中,本论文以M/M/k/k模型为基础,给出了各种典型算法的理论性能模型,分别对这些算法从理论性能上进行分析与比较,介绍了LAUC、LAUC-VF和ODBR三种算法,并对ODBR进行了详细的流程说明,通过对比时间复杂度、和丢包率性能可知,ODBR算法具有类似于LAUC的低复杂度和LAUC-VF的低丢包率。

In optical burst switching （OBS） networks, the data-channel scheduling algorithm plays an important role. Based on the queue model M/M/k/k, this paper describes the theoretic models of various typical algorithms, and presents LVUC, LAUC-VF and ODBR algorithms. Finally, this paper concludes that the ODBR algorithm has low complexity similar to LAUC and low data-loss rate similar to LAUC-VF.