基于输入队列的光分组交换短包抢先调度  

Preemptive Short Packet Scheduling Based-on Input Queue for Optical Packet Switch

作　　者：陈勇[1] 吕恩建[1] 陈泉[1] 

机构地区：[1]重庆邮电大学自动化学院,重庆400065

出　　处：《半导体光电》2008年第1期105-109,共5页Semiconductor Optoelectronics

基　　金：重庆市教委项目(KJ070513;0635213)

摘　　要：光分组交换的输出队头阻塞引起分组的平均排队时延增加。分析了可变长分组的特点,提出了基于抢先方式的短包抢先调度(PSPP)算法,以减少分组在输入排队中的平均等待时间。在PSPP算法中,短包可以抢占长包的传输时间,获得优先的服务。分析和仿真结果表明,当到达业务负载为中或较低时,短包优先调度算法使短包的平均排队时延接近零,所有分组的平均等待时延减小,该算法还保证具有实时特性的TCP业务获得较低的平均等待时延。The average queue delay increases due to the packets block of the output queue header in the optical packet switching. Analyzed is features of variable length packet and propose the preemptive short packets priority（PSPP） algorithm for reducing the total packet waiting time in the input queue. In the PSPP algorithm, the short packet can preempt the transmission time of the long packet and can be served first. The analysis and the simulation results show the PSPP algorithm can make the average waiting time of the short packet decrease to zero almost and reduce the total packet average waiting time largely when the traffic load is middle and low. The PSPP scheduling algorithm can guarantee a low average waiting delay for real time TCP traffic implementations.

关 键 词：光通信 光分组交换 输入队列 短包抢先调度 平均等待时延 

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