【24h】

LOW COMPUTATIONAL COMPLEXITY WEIGHTED QUEUEING USING WEIGHTED DEFICIT ROUND ROBIN

机译:使用加权亏缺轮循的低计算复杂度加权排队

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

A modified Deficit Round Robin Queuing Algorithm, which can be applied in weighted Quality of Service (QoS) enabled network node, is proposed. The proposed Weighted Deficit Round Robin (WDRR) algorithm uses a simple mechanism to provide the weighted control in the nodes. The weight sharing ability of the algorithm remains comparable to the Weighted Fair Queuing (WFQ) and the Worst-case Fair Weighted Fair Queuing Plus (WF~2Q+) algorithms. The computational complexity of the proposed algorithms is, however, lower than both the WFQ and the WF~2Q+, yet provides a fair queuing among different flows in a Constant Bit Rate TCP traffic condition. The proposed algorithm is preferred one to implement weighted QoS in practical network nodes. Weighted Deficit Round Robin can provide fair queueing among different flows in the Constant Bit Rate TCP traffic condition. It is a good choice to enable QoS with weighted function in the network node.
机译:提出了一种改进的亏缺循环调度算法,该算法可以应用于加权服务质量(QoS)网络节点。提出的加权赤字循环法(WDRR)算法使用一种简单的机制在节点中提供加权控制。该算法的权重共享能力仍可与加权公平排队(WFQ)和最坏情况公平加权公平排队Plus(WF〜2Q +)算法相媲美。但是,所提出算法的计算复杂度低于WFQ和WF〜2Q +,但在恒定比特率TCP流量条件下,在不同流之间提供了合理的排队。所提出的算法是在实际网络节点中实现加权QoS的首选算法。加权赤字循环法可以在恒定比特率TCP流量条件下提供不同流之间的公平排队。在网络节点中启用具有加权功能的QoS是一个不错的选择。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号