| Alternate document: Details Performance Models for LAS-based Scheduling Disciplines in a Packet Switched Network (04) Idris A. Rai, Guillaume Urvoy-Keller, et al. |
(Enter summary)
Abstract: 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... (Update)
Active bibliography (related documents): More All
2.1: Performance Models for LAS-based Scheduling Disciplines.. - Rai, Urvoy-Keller, al. (2004)
(Correct)
0.7: LAS scheduling to improve the performance of short TCP Flows - Rai, Biersack, Urvoy-Keller (2004)
(Correct)
0.7: Analyzing the Performance of TCP Flows in Packet Networks with.. - Rai, al. (2003)
(Correct)
Similar documents based on text: More All
0.6: Analysis of LAS Scheduling for Job Size Distributions.. - Rai, Urvoy-Keller.. (2003)
(Correct)
0.3: Size-based Scheduling to Improve the Performance of.. - Rai, Biersack.. (2004)
(Correct)
0.3: Architectural Choices for Video-on-Demand Systems - Al Hamra Biersack
(Correct)
BibTeX entry: (Update)
@inproceedings{ 1005702,
author = {Idris A. Rai and Guillaume Urvoy-Keller and Mary K. Vernon and Ernst W. Biersack},
title = {Performance analysis of LAS-based scheduling disciplines in a packet switched network},
booktitle = {SIGMETRICS '04/Performance '04: Proceedings of the joint international conference on Measurement and modeling of computer systems},
year = {2004},
isbn = {1-58113-873-3},
pages = {106--117},
location = {New York, NY, USA},
doi = {http://doi.acm.org/10.1145/1005686.1005702},
publisher = {ACM Press},
address = {New York, NY, USA},
url = {citeseer.ist.psu.edu/rai04performance.html} }
Citations (may not include all citations):
607
Modeling TCP Throughput: A Simple Model and its Empirical Va..
- Padhye, Firoiu et al. - 1998
135
Operating Systems Theory (context) - Coffman, Denning - 1973
123
Dynamics of IP traffic: A study of the role of variability a..
- Feldmann, Gilbert et al. - 1999
90
The nature of the beast: Recent traffic measurements from an.. (context) - Claffy, Miller et al. - 1998
87
Volume II: Computer Applications (context) - Kleinrock, Systems - 1976
64
Analysis of SRPT Scheduling: Investigating Unfairness
- Bansal, Harchol-Balter - 2001
33
Long-lasting transient conditions in simulations with heavy-..
- Crovella, Lipsky - 1997
26
Implementation of SRPT Scheduling in Web Servers (context) - Harchol-Balter - 2001
20
Asymptotic Convergence of Scheduling Policies with respect t.. (context) - Harchol-Balter, Sigman et al. - 2002
20
Server-based Inference of Internet Link Lossiness
- Padmanabhan, Qiu et al. - 2003
20
Analysis of LAS Scheduling for Job Size Distributions with H..
- Rai, Urvoy-Keller et al. - 2003
19
Fast and Scalable Priority Queue Architecture for High-Speed..
- Bhagwan, Lin - 2000
12
Size-based Adaptive bandwidth Allocation: Optimizing the Ave..
- Yang, Veciana - 2002
11
Wide-Area Traffic: The failure of Poisson Modelling (context) - Paxon, Floyd - 1995
10
Preferential Treatment for Short Flows to Reduce Web Latency
- Chen, Heidemann - 2003
10
Scheduling Flows with Unknown Sizes: Approximate Analysis
- Guo, Matta - 2002
9
Classifying Scheduling Policies with Respect to Unfairness i..
- Wierman, Harchol-Balter - 2003
9
The Effect of Heavy-Tailed Job Size. Distributions on Comput.. (context) - Harchol-Balter - 1999
5
Quality of service evaluations of multicast streaming protoc..
- Tan, Eager et al. - 2002
5
Mixed Scheduling Disciplines for Network Flows (context) - Feng, Misra - 2003
4
A Practical Guide to Heavy Tails (context) - Crovella - 1998
4
Analyzing the Performance of TCP Flows in Packet Networks wi..
- Rai, Biersack et al. - 2003
3
Fairness and efficiency in Web Servers (context) - Friedman, Henderson - 2003
http://www.isi.edu/nsnam/ns/
Documents on the same site (http://www.eurecom.fr/~rai/): More
Comparison of PS, SRPT, and FB Scheduling Policies under . . . - Rai, al. (2001)
(Correct)
On Reducing Response Time for VPN Traffic - Rai, al. (2002)
(Correct)
LAS scheduling to avoid bandwidth hogging in.. - Rai, Urvoy-Keller..
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC