Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Real-Time Virtual Resource: A Timely Abstraction for Embedded Systems
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Lexicographic QoS scheduling for parallel I/O
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
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
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Towards distributed storage resource management using flow control
ACM SIGOPS Operating Systems Review
Embedded fuzzy expert system for Adaptive Weighted Fair Queueing
Expert Systems with Applications: An International Journal
Low latency and efficient packet scheduling for streaming applications
Computer Communications
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Fuzzy service classifier for QoS improvement
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
mClock: handling throughput variability for hypervisor IO scheduling
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Postgate: QoS-aware bandwidth management for last-mile ADSL broadband services
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
A novel low latency packet scheduling scheme for broadband networks
PCM'05 Proceedings of the 6th Pacific-Rim conference on Advances in Multimedia Information Processing - Volume Part II
Demand based hierarchical QoS using storage resource pools
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Proportional Allocation of Resources on Shared Ring Buffer for Virtualization
International Journal of Cloud Applications and Computing
Hi-index | 0.01 |
We present Start-time Fair Queuing (SFQ) algorithm that is computationally efficient, achieves fairness regardless of variation in a server capacity, and has the smallest fairness measure among all known fair scheduling algorithms. We analyze its throughput, single server delay, and end-to-end delay guarantee for variable rate Fluctuation Constrained (FC) and Exponentially Bounded Fluctuation (EBF) servers. We show that SFQ is better suited than Weighted Fair Queuing for integrated services networks and it is strictly better than Self Clocked Fair Queuing. To support heterogeneous services and multiple protocol families in integrated services networks, we present a hierarchical SFQ scheduler and derive its performance bounds. Our analysis demonstrates that SFQ is suitable for integrated services networks since it: (1) achieves low average as well as maximum delay for low-throughput applications (e.g., interactive audio, telnet, etc.); (2) provides fairness which is desirable for VBR video; (3) provides fairness, regardless of variation in server capacity, for throughput-intensive, flow-controlled data applications; (4) enables hierarchical link sharing which is desirable for managing heterogeneity; and (5) is computationally efficient.