Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
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
What TCP/IP protocol headers can tell us about the web
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Characterizing reference locality in the WWW
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Operating Systems Theory
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
Performance Evaluation with Heavy Tailed Distributions
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Preferential treatment for short flows to reduce web latency
Computer Networks: The International Journal of Computer and Telecommunications Networking
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Connection scheduling in web servers
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
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
Two-level processor-sharing scheduling disciplines: mean delay analysis
Proceedings of the joint international conference on Measurement and modeling of computer systems
Performance analysis of LAS-based scheduling disciplines in a packet switched network
Proceedings of the joint international conference on Measurement and modeling of computer systems
A survey on statistical bandwidth sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
On the relationship between coefficient of variation and the performance of M/G/1-FB queues
ACM SIGMETRICS Performance Evaluation Review
Nearly insensitive bounds on SMART scheduling
SIGMETRICS '05 Proceedings of the 2005 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
Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling
Queueing Systems: Theory and Applications
Stability of size-based scheduling disciplines in resource-sharing networks
Performance Evaluation - Performance 2005
Web servers under overload: How scheduling can help
ACM Transactions on Internet Technology (TOIT)
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
Delay-optimal scheduling in bandwidth-sharing networks
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Revisiting unfairness in web server scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Comparing FB and PS scheduling policies
ACM SIGMETRICS Performance Evaluation Review
Improving confidence in network simulations
Proceedings of the 38th conference on Winter simulation
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
Performance Evaluation
Game-Theoretic Approach for Load Balancing in Computational Grids
IEEE Transactions on Parallel and Distributed Systems
The Foreground-Background queue: A survey
Performance Evaluation
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
Improving flow level fairness and interactivity in WLANs using size-based scheduling policies
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
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
Event Based Fairness for Video Surveillance Sensor Networks
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Optimality, fairness, and robustness in speed scaling designs
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Size-based and direction-based TCP fairness issues in IEEE 802.11 WLANs
EURASIP Journal on Wireless Communications and Networking
A case for on-machine load balancing
Journal of Parallel and Distributed Computing
Fast track article: Least attained recent service for packet scheduling over access links
Pervasive and Mobile Computing
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues
Operations Research Letters
Decoupled speed scaling: Analysis and evaluation
Performance Evaluation
Hi-index | 0.00 |
Recent studies of Internet traffic have shown that flow size distributions often exhibit a high variability property in the sense that most of the flows are short and more than half of the total load is constituted by a small percentage of the largest flows. In the light of this observation, it is interesting to revisit scheduling policies that are known to favor small jobs in order to quantify the benefit for small and the penalty for large jobs. Among all scheduling policies that do not require knowledge of job size, the least attained service (LAS) scheduling policy is known to favor small jobs the most. We investigate the M/G/1/LAS queue for both, load ? and ? = 1. Our analysis shows that for job size distributions with a high variability property, LAS favors short jobs with a negligible penalty to the few largest jobs, and that LAS achieves a mean response time over all jobs that is close to the mean response time achieved by SRPT.Finally, we implement LAS in the ns-2 network simulator to study its performance benefits for TCP flows. When LAS is used to schedule packets over the bottleneck link, more than 99% of the shortest flows experience smaller mean response times under LAS than under FIFO and only the largest jobs observe a negligible increase in response time. The benefit of using LAS as compared to FIFO is most pronounced at high load.