首页> 外文学位 >A class of Shaped Deficit Round-Robin (SDRR) schedulers.
【24h】

A class of Shaped Deficit Round-Robin (SDRR) schedulers.

机译:一类定型赤字轮转(SDRR)调度程序。

获取原文
获取原文并翻译 | 示例

摘要

Scheduling mechanisms are deployed in the egress linecards of modern Internet routers to control dequeue from packet memory. Scheduling is required because the egress link fed by packet memory may be channelized (partitioned) and individual flows within each channel may have different priorities or have explicit bandwidth allotments. At extremely high data-rates, schedulers must possess extremely low computation complexity and be able to handle flows of variable-length packets. Existing examples of such schedulers include deficit round robin (DRR). In addition, it may be desirable to limit the variation about the peak-rate (jitter or burstiness) of certain egress flows (e.g., those under expedited forwarding (EF) service) so that their packets are not deemed out-of-profile down stream and possibly dropped as a result.; In this research, a scheduler called Shaped Deficit Round-Robin (SDRR) is proposed based on a multiple time-scale decomposition using Shaped Weighted Round-Robin (SWRR) and Deficit Round-Robin (DRR) ideas wherein the deficit counter itself is used for shaping instead of a separate leaky bucket, resulting in O(1) per packet computational complexity. SDRR is proved to have a strict and precisely defined per-flow shaping property making it unique among existing DRR schedulers. As such, the SDRR scheduler is suitable for very high speed multiplexing of flows of variable-length packets.; Although SDRR is implementable at high-speeds and has a strict and precisely defined per-flow shaping property, flows, especially those with larger bandwidth allocations, tend to receive less bandwidth than allocated. To improve the under-allocated bandwidth problem while maintaining the ability to limit per-flow shaping property, a Hierarchical Shaped Deficit Round-Robin (HSDRR) is defined. HSDRR is a hybrid round-robin/time-stamp scheduler that employs SDRR scheduling in the first stage and Shaped Virtual Clock (SVC) in the second and final stage. Moreover, feasible varieties of SDRR that we have considered to achieve better packet latency performance or be partially work-conserving are described.
机译:在现代Internet路由器的出口线路卡中部署了调度机制,以控制从数据包内存中出队。需要进行调度是因为由分组存储器馈送的出口链路可能会被通道化(分区),并且每个通道内的各个流可能具有不同的优先级或具有明确的带宽分配。在极高的数据速率下,调度程序必须具有极低的计算复杂度,并且能够处理可变长度数据包的流。这样的调度器的现有示例包括赤字循环(DRR)。另外,可能希望限制某些出口流(例如,那些在快速转发(EF)服务下的出口流)的峰值速率(抖动或突发性)的变化,以使它们的数据包不被认为超出规范。流,结果可能掉线。在这项研究中,基于形状加权轮循(SWRR)和赤字轮循(DRR)的思想,其中使用了赤字计数器本身,在多重时间尺度分解的基础上,提出了一种称为“形状缺陷轮循(SDRR)”的调度程序。用于整形而不是单独的泄漏桶,导致每个数据包的O(1)计算复杂性。事实证明,SDRR具有严格且精确定义的每流整形属性,从而使其在现有DRR调度程序中独一无二。这样,SDRR调度器适用于可变长度分组流的超高速复用。尽管SDRR可以高速实现,并且具有严格且精确定义的按流整形属性,但是流(尤其是那些带宽分配较大的流)接收的带宽往往少于分配的带宽。为了改善分配不足的带宽问题,同时保持限制每流整形属性的能力,定义了分层整形赤字循环(HSDRR)。 HSDRR是一种混合轮询/时间戳调度程序,在第一阶段使用SDRR调度,在第二阶段和最后阶段采用成形虚拟时钟(SVC)。此外,还介绍了我们考虑过的可行的SDRR品种,以实现更好的分组等待时间性能或部分节省工作。

著录项

  • 作者

    Jiwasurat, Soranun.;

  • 作者单位

    The Pennsylvania State University.;

  • 授予单位 The Pennsylvania State University.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2005
  • 页码 106 p.
  • 总页数 106
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号