Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Operating system support for multimedia applications
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Efficient fair queueing using deficit round-robin
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)
Building a robust software-based router using network processors
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Fair and Efficient Packet Scheduling Using Elastic Round Robin
IEEE Transactions on Parallel and Distributed Systems
MMNS '02 Proceedings of the 5th IFIP/IEEE International Conference on Management of Multimedia Networks and Services: Management of Multimedia on the Internet
Predicting and Controlling Resource Usage in a Heterogeneous Active Network
AMS '01 Proceedings of the Third Annual International Workshop on Active Middleware Services
Scheduling Resources in Programmable and Active Networks Based on Adaptive Estimations
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
Low-latency guaranteed-rate scheduling using Elastic Round Robin
Computer Communications
Implementing scheduling algorithms in high-speed networks
IEEE Journal on Selected Areas in Communications
A novel resource scheduling algorithm for QoS-aware services on the Internet
Computers and Electrical Engineering
An experimental analysis of biased parallel greedy approximation for combinatorial auctions
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |
Over the past decade, the problem of fair bandwidth allocation among contending traffic flows on a link has been extensively researched. However, as these flows traverse a computer network, they share different kinds of resources (e.g., links, buffers, router CPU). The ultimate goal should hence be overall fairness in the allocation of multiple resources rather than a specific resource. Moreover, conventional resource scheduling algorithms depend strongly upon the assumption of prior knowledge of network parameters and cannot handle variations or lack of information about these parameters. In this paper, we present a novel scheduler called the Composite Bandwidth and CPU Scheduler (CBCS), which jointly allocates the fair share of the link bandwidth as well as processing resource to all competing flows. CBCS also uses a simple and adaptive online prediction scheme for reliably estimating the processing times of the incoming data packets. Analytically, we prove that CBCS is efficient, with a per-packet work complexity of O(1). Finally, we present simulation results and experimental outcomes from a real-world implementation of CBCS on an Intel IXP 2400 network processor. Our results highlight the improved performance achieved by CBCS and demonstrate the ease with which it can be implemented on off-the-shelf hardware.