Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Long-lasting transient conditions in simulations with heavy-tailed workloads
Proceedings of the 29th conference on Winter simulation
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Dynamics of IP traffic: a study of the role of variability and the impact of control
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Quality of service evaluations of multicast streaming protocols
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling flows with unknown sizes: approximate analysis
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Operating Systems Theory
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
SRPT Scheduling for Web Servers
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Preferential treatment for short flows to reduce web latency
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analysis of LAS scheduling for job size distributions with high variance
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fairness and efficiency in web server protocols
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Classifying scheduling policies with respect to unfairness in an M/GI/1
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Classifying scheduling policies with respect to higher moments of conditional response time
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Stability of size-based scheduling disciplines in resource-sharing networks
Performance Evaluation - Performance 2005
Tail asymptotics for policies favoring short jobs in a many-flows regime
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Sojourn times in (discrete) time shared systems and their continuous time limits
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Tail equivalence for some time-shared systems
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
On the effect of inexact size information in size based policies
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
PBS: a unified priority-based scheduler
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Adaptive and scalable comparison scheduling
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance Evaluation
The Foreground-Background queue: A survey
Performance Evaluation
Asymptotic properties of sojourn times in multiclass time-shared systems
Probability in the Engineering and Informational Sciences
Scheduling despite inexact job-size information
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
TCP fairness issues in IEEE 802.11 wireless LANs
Computer Communications
Sojourn times in (discrete) time shared systems and their continuous time limits
Queueing Systems: Theory and Applications
On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks
Network Control and Optimization
Optimal scheduling of jobs with a DHR tail in the M/G/1 queue
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Size-based and direction-based TCP fairness issues in IEEE 802.11 WLANs
EURASIP Journal on Wireless Communications and Networking
EFD: an efficient low-overhead scheduler
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Fast track article: Least attained recent service for packet scheduling over access links
Pervasive and Mobile Computing
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
M/G/1/MLPS compared to M/G/1/PS
Operations Research Letters
A spike-detecting AQM to deal with elephants
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
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 short flows while not significantly increasing the average flow time for the long flows that share the same bottleneck. No modification of the packet headers is required to implement the simple LAS policy. However, previous work has also shown that a drawback of the LAS scheduler is that, when link utilization is greater than 70%, long flows experience large jitter in their packet transfer times as compared to the conventional First-Come-First-Serve (FCFS) link scheduling. This paper proposes and evaluates new differentiated LAS scheduling policies that reduce the jitter for long flows that are identified as "priority" flows.To evaluate the new policies, we develop analytic models to estimate average flow transfer time as a function of flow size, and average packet transmission time as a function of position in the flow, for the single-bottleneck "dumbbell topology" used in many ns simulation studies. Models are developed for FCFS scheduling, LAS scheduling, and each of the new differentiated LAS scheduling policies at the bottleneck link. Over a wide range of configu-rations, the analytic estimates agree very closely with the ns estimates. Thus, the analytic models can be used instead of simulation for comparing the policies with respect to mean flow transfer time (as a function of flow size) and mean packet transfer time. Furthermore, an initial discrepancy between the analytic and simulation estimates revealed errors in the parameter values that are often specified in the widely used ns Web workload generator. We develop an improved Web workload specification, which is used to estimate the packet jitter for long flows (more accurately than with previous simulation workloads).Results for the scheduling policies show that a particular policy, LAS-log, greatly improves the mean flow transfer time for priority long flows while providing performance similar to LAS for the ordinary flows. Simulations show that the LAS-log policy also greatly reduces the jitter in packet delivery times for the priority flows.