Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (7): 96-98.DOI: 10.3778/j.issn.1002-8331.2010.07.029

• 网络、通信、安全 • Previous Articles     Next Articles

Providing absolute QoS graduation using priority scheduling algorithm

WU Yan-hong,CHEN Xiang-ning   

  1. Safe Communication Research Lab,Nanjing University,Nanjing 210093,China
  • Received:2008-09-10 Revised:2008-12-05 Online:2010-03-01 Published:2010-03-01
  • Contact: WU Yan-hong

一种可提供绝对服务质量分级的优先调度算法

吴彦宏,陈相宁   

  1. 南京大学 网络安全通信实验室,南京 210093
  • 通讯作者: 吴彦宏

Abstract: A multi-priority algorithm is proposed which can provide the guarantee of low end-to-end delay and satisfy the request of low packets-drop rate.The algorithm takes the latency,the packets-drop rate in records and the guarantee of bandwidth as the weight to carry on the dispatch,uses the cell’s relative priority and the quality of service parameter’s weighting algorithm to obtain an algorithm which can satisfy absolute quality of service.The algorithm also can made the system to avoid maintaining each class’s status messages as well as carrying on complex queue management and dispatch to each single class,thereby increases the system’s extendibility.Simulation has proved that this algorithm has the high utility ratio of resources,low end-to-end delay and latency vibration,as well as low grouping discarding rate.

Key words: absolute quality of service, packet droped ratio, latency, weight

摘要: 提出了一种能够提供端到端时延保证和满足丢包率要求的多优先级算法。该算法以分组头中记录的时延、丢包率、保证带宽为权重对分组进行调度,通过对信元的相对优先级及服务质量参数的加权算法,得到一种公平的满足绝对服务质量的算法。还能够使系统避免维护每个流的状态信息以及对单个流进行复杂的队列管理和调度,由此增加了系统的可扩展性。计算机仿真表明该算法具有较高的资源利用率,较低的端到端时延和时延抖动以及较低的分组丢弃率等特点。

关键词: 绝对服务质量, 丢包率, 时延, 权值

CLC Number: