The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...
Idris A. Rai, Guillaume Urvoy-Keller, Mary K. Vern...
Currently, wireless priority services (WPS) are provided using call queueing with a weighted round-robin schedule based on a fixed parameter. In this paper, we introduce a flexi...
— We show that different flavors of TCP may be viewed as implementations of age-based scheduling disciplines. By parameterizing the scheduling disciplines of interest we are abl...
ShareStreams (Scalable Hardware Architectures for Stream Schedulers) is a canonical architecture for realizing a range of scheduling disciplines. This paper discusses the design c...
Abstract—In this paper, we focus on applications with quantitative QoS (Quality of Service) requirements in their end-toend response time. Two types of quantitative QoS garantees...