Abstract
Size-based scheduling is advocated to improve response times of small flows. While researchers continue to explore different ways of giving preferential treatment to small flows without causing starvation to other flows, little focus has been paid to the study of stability of systems that deploy size-based scheduling mechanisms. The question on stability arises from the fact that, users of such a system can exploit the scheduling mechanism to their advantage and split large flows into multiple small flows. Consequently, a large flow in the disguise of small flows, may get the advantage aimed for small flows. As the number of misbehaving users can grow to a large number, an operator would like to learn about the system stability before deploying size-based scheduling mechanism, to ensure that it won’t lead to an unstable system. In this paper, we analyse the criteria for the existence of equilibria and reveal the constraints that must be satisfied for the stability of equilibrium points. Our study exposes that, in a two-player game, where the operator strives for a stable system, and users of large flows behave to improve delay, size-based scheduling doesn’t achieve the goal of improving response time of small flows.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kleinrock, L.: Queueing Systems, Volume II: Computer Applications. Wiley Interscience, Hoboken (1976)
Avrachenkov, K., Ayesta, U., Brown, P., Nyberg, E.: Differentiation Between Short and Long TCP Flows: Predictability of the Response Time. In: Proc. IEEE INFOCOM (2004)
Sun, C., Shi, L., Hu, C., Liu, B.: DRR-SFF: A Practical Scheduling Algorithm to Improve the Performance of Short Flows. In: ICNS 2007: Proceedings of the Third International Conference on Networking and Services, p. 13 (2007)
Nuyens, M., Wierman, A.: The foreground-background queue: A survey. Perform. Eval. 65(3-4), 286–307 (2008)
Brown, P.: Stability of networks with age-based scheduling. In: Proc. IEEE INFOCOM, pp. 901–909 (2007)
Altman, E., Orda, A., Shimkin, N.: Bandwidth allocation for guaranteed versus best effort service categories. Queueing Syst. Theory Appl. 36(1-3), 89–105 (2000)
Sastry, S.: Nonlinear Systems. Analysis, Stability and Control. Springer, Heidelberg (1999)
Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Soudan, S., Divakaran, D.M., Altman, E., Primet, P.VB. (2009). Equilibrium in Size-Based Scheduling Systems. In: Al-Begain, K., Fiems, D., Horváth, G. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2009. Lecture Notes in Computer Science, vol 5513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02205-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-02205-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02204-3
Online ISBN: 978-3-642-02205-0
eBook Packages: Computer ScienceComputer Science (R0)