Journal of the ACM (JACM)
IEEE/ACM Transactions on Networking (TON)
Operating system support for multimedia applications
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Rate-proportional servers: a design methodology for fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Resource containers: a new facility for resource management in server systems
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Building a robust software-based router using network processors
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
MMNS '02 Proceedings of the 5th IFIP/IEEE International Conference on Management of Multimedia Networks and Services: Management of Multimedia on the Internet
SVR4UNIX Scheduler Unacceptable for Multimedia Applications
NOSSDAV '93 Proceedings of the 4th International Workshop on Network and Operating System Support for Digital Audio and Video
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
Integrated Resource Management and Scheduling with Multi-Resource Constraints
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
IEEE/ACM Transactions on Networking (TON)
An evaluation of fair packet schedulers using a novel measure of instantaneous fairness
Computer Communications
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Implementing scheduling algorithms in high-speed networks
IEEE Journal on Selected Areas in Communications
Resource management in software-programmable router operating systems
IEEE Journal on Selected Areas in Communications
| Hi-index | 14.98 |
Over the past decade, the problem of achieving fair bandwidth allocation on a link shared by multiple traffic flows has been extensively researched. However, as these flows traverse a computer network, they share many different kinds of resources such as links, buffers, and router CPU. The ultimate goal should hence be overall fairness in the allocation of multiple resources rather than a single specific resource such as link bandwidth. In this paper, we present a novel scheduler called Prediction-based Composite Fair Queueing (PCFQ), which jointly allocates the fair share of the link bandwidth as well as processing resource to all competing flows. We derive the worst-case delay bound, the work complexity and the relative fairness bound for the PCFQ scheduler and show that it outperforms a system consisting of separate bandwidth and CPU schedulers. We further present simulation results, which illustrate the improved performance characteristics achieved by PCFQ. We also demonstrate that our composite scheduler can be easily implemented on an off-the-shelf network processor such as the Intel IXP 2400. Experimental results from the IXP2400 implementation highlight the effectiveness and high performance of this algorithm in a real world system.