Scheduling flows with unknown sizes: approximate analysis

@inproceedings{Guo2002SchedulingFW,
  title={Scheduling flows with unknown sizes: approximate analysis},
  author={Liang Guo and Ibrahim Matta},
  booktitle={SIGMETRICS},
  year={2002}
}
Previous job scheduling studies indicate that providing rapid response to interactive jobs which place frequent but small demands, can reduce the overall system average response time [1], especially when the job size distribution is skewed (see [2] and references therein). Since the distribution of Internet flows is skewed, it is natural to design a network system that favors short file transfers through service differentiation. However, to maintain system scalability, detailed per-flow state… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS