考虑光开关稳定响应时间的光分组组装性能分析  

Performance Analysis for Optical Packet Assembly Strategy Considering Switching Time

作　　者：杨俊杰[1] 

机构地区：[1]上海电力学院计算机与信息工程学院,上海200090

出　　处：《半导体光电》2009年第2期254-259,共6页Semiconductor Optoelectronics

基　　金：上海市青年科技启明星计划项目(06QA14023);上海市教育发展基金会晨光计划项目(2007CG66);上海市教育委员会科研创新项目(09ZZ185;09YZ337);上海市重点科技攻关计划项目(071605125)

摘　　要：在光分组交换中,光分组的组装算法将对交换的性能产生重要的影响。由于当前技术水平的限制,光分组的长度与光开关的稳定响应时间粒度相近,因此光开关的稳定响应时间对光分组组装算法的影响必须加以考虑。为此,提出两种考虑光开关稳定响应时间的光分组组装算法,即Threshold-Based-ST算法和Timer-Based-ST算法。采用仿真实验的方法对所提出的组装算法性能进行评估。仿真结果表明,Threshold-Based-ST算法和Timer-Based-ST算法都存在一个最优的组装参数。Optical packet assembly algorithms have great effects on the performances of optical packet switching network. With today＇s technology, the granularity of an optical packet is almost the same as the switching time of an optical switch. Consequently, the influences of switching time on the performance of an optical packet assembly algorithm have to be considered. For this purpose, two improved assembly algorithms, i. e. , Threshold-Based-ST and Timer- Based-ST are proposed. The performances of these two algorithms are evaluated by simulation experiments. Simulation results show that there is an optimal parameter for either of these two assembly algorithms.

关 键 词：光分组交换 光开关 组装算法 

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