IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
A reliable and scalable striping protocol
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
An architecture for packet-striping protocols
ACM Transactions on Computer Systems (TOCS)
Pre-order deficit round robin: a new scheduling algorithm for packet-switched networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fair queuing for aggregated multiple links
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Fair and Efficient Packet Scheduling Using Elastic Round Robin
IEEE Transactions on Parallel and Distributed Systems
On the Latency Bound of Pre-Order Deficit Round Robin
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
A theory of multi-channel schedulers for quality of service
Journal of High Speed Networks
Traffic scheduling in packet-switched networks: analysis, design, and implementation
Traffic scheduling in packet-switched networks: analysis, design, and implementation
Load balancing for parallel forwarding
IEEE/ACM Transactions on Networking (TON)
Load Balancing in a Cluster-Based Web Server for Multimedia Applications
IEEE Transactions on Parallel and Distributed Systems
Sequence-preserving adaptive load balancers
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
The Stratified Round Robin scheduler: design, analysis and implementation
IEEE/ACM Transactions on Networking (TON)
Fair link striping with FIFO delivery on heterogeneous channels
Computer Communications
Design and performance analysis of scheduling algorithms for cable and optical access networks
Design and performance analysis of scheduling algorithms for cable and optical access networks
Adaptive slot allocation in DOCSIS-based CATV networks
IEEE Transactions on Multimedia
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
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.