首页 | 官方网站   微博 | 高级检索  
     

基于多跳间时延协作的最久分组优先算法
引用本文:周卫华,丁炜.基于多跳间时延协作的最久分组优先算法[J].计算机工程,2004,30(13):8-10,31.
作者姓名:周卫华  丁炜
作者单位:北京邮电大学宽带通信网络实验室,北京,100876
基金项目:华为科技基金资助项目“T比特路由器交换结构及高度算法研究”
摘    要:提出了一种基于多跳间时延协作的Crossbar调度算法。该算法以分组头中记录的时延为权重对分组进行调度,通过控制分组在各跳上的时延来达到调节端到端时延的目的。算法还使路由器避免了维护每个流的状态信息以及对单个流进行的复杂的队列管理和调度。计算机仿真表明,算法具有较高的资源利用率、较低的端到端时延抖动和较低的分组丢弃率等特点。

关 键 词:最久分组优先  交叉开关  服务质量  时延抖动
文章编号:1000-3428(2004)13-0008-03

Multihops Delay Coordinated Based Oldest Packet First Algorithm
ZHOU Weihua,DING Wei.Multihops Delay Coordinated Based Oldest Packet First Algorithm[J].Computer Engineering,2004,30(13):8-10,31.
Authors:ZHOU Weihua  DING Wei
Abstract:A delay coordinated based multihops crossbar scheduling algorithm is presented. This algorithm uses the delay recorded in the header of packet as the weight for packets scheduling. Through controlling the delay of packet in different hops, this algorithm can adjust the end-to-end delay of different packets. With this algorithm, the router can avoid maintaining per flow state and avoid complicated per flow buffering and scheduling. Simulation shows that the algorithm has many advantages on the high resource utilization, low jitter of the end-to-end delay and low discarded ratio of the packet.
Keywords:Oldest packet first  Crossbar  Quality of service  Jitter of packet delay
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号