On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks
- 382 Downloads
Size-based scheduling has proved to be effective in a lot of scenarios involving Internet traffic. In this work, we focus on the Least Attained Service Policy, a popular size-based scheduling policy. We tackle two issues that have not received much attention so far. Firstly, the variance of the conditional response time. We prove that the classification proposed by Wierman et al. , which classifies LAS as an always unpredictable policy, is overly pessimistic. We illustrate the latter by focusing on the M/M/1/LAS queue. Secondly, we consider LAS queues in tandem. We provide preliminary results concerning the characterization of the output process of an M/M/1/LAS queue and the conditional average response time of LAS queues in tandem.
Unable to display preview. Download preview PDF.
- 1.Auchmann, M., Urvoy-Keller, G.: On the variance of the least attained service policy and its use in multiple bottleneck networks. Technical Report RR-08-224, Institut Eurecom, France (June 2008), http://www.eurecom.fr/util/popuppubli.fr.htm?page=copyright&id=2497
- 2.Brown, P.: Comparing fb and ps scheduling policies. Technical report, Orange Labs (2008)Google Scholar
- 3.Crovella, M.E., et al.: A Practical Guide to Heavy Tails, ch. 3. Chapman and Hall, New-York (1998)Google Scholar
- 5.Hernandez-Campos, F., Karaliopoulos, M., Papadopouli, M., Shen, H.: Spatio-temporal modeling of traffic workload in a campus wlan. In: WICON 2006, p. 1 (2006)Google Scholar
- 6.Hu, M., Zhang, J., Sadowsky, J.: Size-aided opportunistic scheduling in wireless networks. In: GLOBECOM 2003. IEEE, Los Alamitos (2003)Google Scholar
- 8.Rai, I.A., Urvoy-Keller, G., Biersack, E.W.: Analysis of las scheduling for job size distributions with high variance. In: Proc. ACM SIGMETRICS, June 2003, pp. 218–228 (2003)Google Scholar
- 9.Rai, I.A., Urvoy-Keller, G., Vernon, M., Biersack, E.W.: Performance models for las-based scheduling disciplines in a packet switched network. In: ACM SIGMETRICS-Performance (June 2004)Google Scholar