时隙可变长分组缓存调度算法

摘要

提出了一种采用时隙处理光分组竞争冲突的基于光纤延迟线的光分组交换缓存算法——时隙可变长分组缓存调度算法SVPB(slotted variable-length-packet-capable buffer).该算法根据先到先服务的排队原则,通过对到来的光分组进行时间轴分段处理,解决了FDLs作为缓存器的不足.从仿真结果得到,在网络负载较高时所提出的调度算法SVPB比已有的调度算法分组丢失率有明显的降低.%An algorithm of optical packet switching which based on Fiber Delay Lines(FDL) is designed to deal with competitive conflict of optical packets competition through using time slots. The algorithm is called slotted variable-length-packet-capable buffer scheduling algorithm (SVPB). The lacking which uses FDL to buffer packet is resolved through process packet in a time quantum. The simulation results show that when the traffic load is more than 0.6, the sorting buffer algorithm is efficient to decrease packet loss rate than existing buffer algorithms.