Supporting best-effort traffic with fair service curve

Authors:
T. S. Eugene Ng;Donpaul C. Stephens;Ion Stoica;Hui Zhang
Affiliations:
Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA;Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA;Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA;Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA
Venue:
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
1999

A hierarchical fair service curve algorithm for link-sharing, real-time and priority services

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Efficient policies for carrying Web traffic over flow-switched networks

IEEE/ACM Transactions on Networking (TON)

Enhancing router QoS through job scheduling with weighted shortest processing time-adjusted

Computers and Operations Research
pClock: an arrival curve based approach for QoS guarantees in shared storage systems

Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
RFQ: Redemptive Fair Queuing

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
mClock: handling throughput variability for hypervisor IO scheduling

OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation

Hi-index	0.00