首页> 外文期刊>Computer networks >Bonded deficit round robin scheduling for multi-channel networks
【24h】

Bonded deficit round robin scheduling for multi-channel networks

机译:多通道网络的约束赤字轮循调度

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

摘要

In order to increase the link capacity in telecommunication networks the bandwidth of multiple channels can be aggregated by transmitting on them simultaneously. The latest data-over-cable service interface specification (DOCSIS 3.0) for hybrid fiber coax networks defines a mechanism for channel bonding at the link layer. Thus, the scheduler at the cable modem termination system, which distributes the packets on the network, not only has to support per-flow queuing but also has to distribute the packets to one modem over possibly several channels. In this article we propose two downstream multi-channel packet scheduling algorithms designed to support scheduling amongst flows possibly using different numbers of channels. Both algorithms are based on the deficit round robin (DRR) scheduler. The bonded deficit round robin (BDRR) algorithm, has complexity dependent only on the number of the channels and requires only one queue per flow. It is shown that the algorithm is a latency-rate server and the latency is derived. Furthermore, BDRR bounds the packet reordering and the maximum bounds on the packet delay and the reorder buffer needed at the receiver are calculated. The paper explores also a second algorithm which has more similarities with load balancing algorithms. It uses fully independent channel schedulers thus avoiding the need for modification in the single channel DRR algorithm. The transmission channel for a packet is selected upon its arrival. However, the algorithm does not bound the latency and packet reorder for flows assigned to receive on multiple channels. Flows for which such bound is needed should be assigned on a single channel.
机译:为了增加电信网络中的链路容量,可以通过在多个信道上同时发送来聚合多个信道的带宽。用于混合光纤同轴网络的最新的有线数据服务接口规范(DOCSIS 3.0)定义了一种在链路层进行通道绑定的机制。因此,在电缆调制解调器终端系统上的调度器在网络上分发分组,该调度器不仅必须支持按流排队,而且还必须通过可能的几个信道将分组分发给一个调制解调器。在本文中,我们提出了两种下游多通道数据包调度算法,这些算法旨在支持可能使用不同数量通道的流之间的调度。两种算法均基于缺陷轮循(DRR)调度程序。绑定亏缺轮询算法(BDRR)算法的复杂度仅取决于通道数,每个流仅需要一个队列。结果表明,该算法是一个延迟率服务器,可以导出延迟。此外,BDRR限制了数据包的重新排序,并计算了数据包延迟的最大限制以及接收器所需的重新排序缓冲区。本文还探讨了第二种算法,该算法与负载平衡算法有更多相似之处。它使用完全独立的信道调度程序,从而避免了单信道DRR算法中修改的需要。数据包到达时选择其传输通道。但是,该算法不限制分配给在多个通道上接收的流的等待时间和数据包重排序。需要这种限制的流应该在单个通道上分配。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号