| 时隙可变长分组缓存调度算法 |
| |
| 引用本文： | 杜晓萍.时隙可变长分组缓存调度算法[J].电视技术,2012,36(21):93-95. |
| |
| 作者姓名： | 杜晓萍 |
| |
| 作者单位： | 桂林电子科技大学光通信研究所,广西桂林,541004 |
| |
| 基金项目： | 广西研究生创新项目（2010105950810M16） |
| |
| 摘 要： | 提出了一种采用时隙处理光分组竞争冲突的基于光纤延迟线的光分组交换缓存算法——时隙可变长分组缓存调度算法SVPB(slotted variable-length-packet-capable buffer)。该算法根据先到先服务的排队原则,通过对到来的光分组进行时间轴分段处理,解决了FDLs作为缓存器的不足。从仿真结果得到,在网络负载较高时所提出的调度算法SVPB比已有的调度算法分组丢失率有明显的降低。
|
| 关 键 词： | 光分组交换 光纤延迟线 时隙 先到先服务 空隙填充 |
| 收稿时间： | 2011/12/20 0:00:00 |
| 修稿时间： | 2/9/2012 3:08:35 PM |
Slotted Variable-length-packet-capable Buffer Scheduling Algorithm |
| |
| duxiaoping.Slotted Variable-length-packet-capable Buffer Scheduling Algorithm[J].Tv Engineering,2012,36(21):93-95. |
| |
| Authors: | duxiaoping |
| |
| Affiliation: | Guilin University of Electronic Technology |
| |
| Abstract: | A algorithm of optical packet switching which based on fiber delay lines(FDLs) is designed to deal with contension of optical packet,s competition through use time slots. The algorithm is called slotted variable-length-packet-capable buffer scheduling algorithm(SVPB). The lacking which use FDLs to buffer packet is resolved through process packet in a time quantum. When the traffic loas is more than 0.6,the sorting buffer alorithm is efficient to decrease packet loss rate than existing buffer alorithms. |
| |
| Keywords: | optical packet switching fiber-delay-lines slotted-time first-come-first-service void fill |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《电视技术》浏览原始摘要信息 |
|
点击此处可从《电视技术》下载全文 |
