计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (24): 138-140.

• 网络、通信与安全 • 上一篇    下一篇

区分服务中一种公平的汇聚流标记算法

张治国,李向丽,邱保志   

  1. 郑州大学 信息工程学院,郑州 450052
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-08-21 发布日期:2007-08-21
  • 通讯作者: 张治国

Fair aggregate marking algorithm in diffServ

ZHANG Zhi-guo,LI Xiang-li,QIU Bao-zhi   

  1. School of Information Engineering,Zhengzhou University,Zhengzhou 450052,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-08-21 Published:2007-08-21
  • Contact: ZHANG Zhi-guo

摘要: 区分服务是提供QoS的重要机制之一,但在区分服务中存在着汇聚流之间剩余带宽分配的不公平性问题。为解决该问题,提出了动态数据包标记算法(DPMA),该算法通过监测汇聚流的流速变化,能动态地调整标记策略,它能以一种近似按比例的方式在各汇聚流之间公平地分配网络中的剩余带宽。仿真结果表明该算法是有效的。

关键词: 区分服务, 标记算法, QoS

Abstract: Diffserv is an important mechanism to provide QoS,but there are unfairness problem in sharing the excess bandwidth between aggregates.To solve the problem,this paper proposes an algorithm named DPMA which changes the marking policies dynamically according to the change of the aggregates’s speed.The algorithm achieves proportional fair sharing of excess bandwidth among aggregates.Simulation result shows that the algorithm is effective.

Key words: diffserv, marking algorithm, QoS