| 异步光分组交换的缓存排序方案及性能 |
| |
| 引用本文： | 刘焕淋,陈前斌,潘英俊. 异步光分组交换的缓存排序方案及性能[J]. 光电子．激光, 2007, 18(10): 1199-12,021,223 |
| |
| 作者姓名： | 刘焕淋 陈前斌 潘英俊 |
| |
| 作者单位： | 重庆邮电大学通信学院,重庆,400065;重庆大学光电技术及系统教育部重点实验室,重庆,400044;重庆邮电大学通信学院,重庆,400065;重庆大学光电技术及系统教育部重点实验室,重庆,400044 |
| |
| 基金项目： | 国家自然科学基金资助项目（90304004）;重庆市教育委员会科学技术研究项目资助（KJ070513）;重庆邮电大学自然基金资助项目（A2006-51） |
| |
| 摘 要： | 分析了简单的先到先服务(FCFS)光纤延迟线(FDL)循环占用方案性能,发现其分组丢失率(PLR)较高,提出3种输入分组按长度排序,寻找最小的FDL缓存优化分配方案.分析和仿真结果表明:约10%的分组排序后使3种方案都大大地能减小PLR,最小长度分组占用最小可用FDL缓存方案的性能最好.业务负载低于0.8时,排序的缓存方案对管理有限的FDL是有效的.
|
| 关 键 词： | 光分组交换(OPS) 缓存排序 分组丢率失(PLR) 冲突解决 光纤延迟线(FDL) |
| 文章编号： | 1005-0086（2007）10-1199-04 |
| 修稿时间： | 2006-11-29 |
Performance and Buffer Sorting Scheme for Asynchronous Optical Packet Switch |
| |
| LIU Huan-lin,CHEN Qian-bin,PAN Ying-jun. Performance and Buffer Sorting Scheme for Asynchronous Optical Packet Switch[J]. Journal of Optoelectronics·laser, 2007, 18(10): 1199-12,021,223 |
| |
| Authors: | LIU Huan-lin CHEN Qian-bin PAN Ying-jun |
| |
| Affiliation: | 1. School of Telecommunication ,Chongqing University of Posts and Telecommunictions ,Chongqing 400065 ,China 2. Key Lab. of Optoelectronic Technology and System, Ministry of Education, Chongqing University, Chongqing 400044, China |
| |
| Abstract: | By analyzing the performance of simple fiber delay lines(FDL) round-robin occupancy shceme on a first-come first-serve 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... |
| |
| Keywords: | optical packet contention(OPS) buffer sorting packet loss ratio(PLR) contention resolution fiber delay line(FDL) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《光电子．激光》浏览原始摘要信息 |
|
点击此处可从《光电子．激光》下载全文 |
|
