异步光分组交换的缓存排序方案及性能  

Performance and Buffer Sorting Scheme for Asynchronous Optical Packet Switch

作　　者：刘焕淋[1] 陈前斌[1] 潘英俊[2] 

机构地区：[1]重庆邮电大学通信学院,重庆400065 [2]重庆大学光电技术及系统教育部重点实验室,重庆400044

出　　处：《光电子．激光》2007年第10期1199-1202,1223,共5页Journal of Optoelectronics·Laser

基　　金：国家自然科学基金资助项目(90304004);重庆市教育委员会科学技术研究项目资助(KJ070513);重庆邮电大学自然基金资助项目(A2006-51)

摘　　要：分析了简单的先到先服务(FCFS)光纤延迟线(FDL)循环占用方案性能,发现其分组丢失率(PLR)较高,提出3种输入分组按长度排序,寻找最小的FDL缓存优化分配方案。分析和仿真结果表明:约10%的分组排序后使3种方案都大大地能减小PLR,最小长度分组占用最小可用FDL缓存方案的性能最好。业务负载低于0.8时,排序的缓存方案对管理有限的FDL是有效的。By analyzing the performance of simple fiber delay lines（FDL） roun＆rohin occupancy shceme on a first-come firstserve basis we find the packet loss rate（PLR） is high. Three schemes,which are able to sort the arrived optical packets based on the packet length and find the least buffer occupancy,are proposed. Analysis and simulation results show that all three proposed schemes can decrease the PLR largely while 10% of the packets are sorted. The scheme in which the shortest length packet first assigns the elast occupied buffer can get the best performance. When the traffic load is less than 0. 8, the sorting buffer scheme is efficient to manage the limited number of FDLs.

关 键 词：光分组交换(OPS) 缓存排序 分组丢率失(PLR) 冲突解决 光纤延迟线(FDL) 

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