Advertisement

Stochastic Ordering of Queues

  • François Baccelli
  • Pierre Brémaud
Chapter
Part of the Applications of Mathematics book series (SMAP, volume 26)

Abstract

Since many queueing systems are analytically intractable, one often has to resort to more qualitative properties such as the monotonicity of the waiting or sojourn times with respect to the service or inter-arrival times. This often leads to the derivation of bounds that may give useful information on the behavior of a system that cannot be exactly computed. Another application of stochastic comparison is optimal design, where one does not necessarily want to compute the performance of a particular system, but one only wishes to show that the system is the best, for some criteria, among a given class of systems. Such optimality results are collected in § 4.1.

Keywords

Service Time Sojourn Time Service Discipline Stochastic Order Integral Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographical Comments

  1. 127.
    Muirhead, R.F. (1903) Some Methods Applicable to Identities and Inequalities of Symmetric Algebraic Functions of n Letters, Proceedings of Edinburgh Mathematical Society 21, pp. 144–157.Google Scholar
  2. 149.
    Schur, I. (1923) Ober eine Klasse von Mittelbildungen mit Anwendungen die Determinanten, Theorie Sitzung. Berlin Math. Gesellschaft, 22, pp. 9–20.Google Scholar
  3. 5.
    Arnold, B.C. (1987) Majorization and the Lorenz Order: A Brief Introduction, Lecture Notes in Statistics, 43, Springer-Verlag, New York.Google Scholar
  4. 114.
    Marshall, A.W. and Olkin, I. (1979) Inequalities: Theory of Majorization and Its Applications, Academic Press, New York.zbMATHGoogle Scholar
  5. 95.
    Kingman, J.F.C. (1976) Subadditive Processes, Ecole d’Eté de Probabilité de Saint-Flour, Springer-Verlag, New York.Google Scholar
  6. 63.
    Foss, S. and Konstantopoulos, T. (2002) Extended Renovation Theory and Limit Theorems for Stochastic Ordered Graphs,preprint.Google Scholar
  7. 43.
    Brill, P.H. and Posner, M.J.M (1977) Level Crossings in Point Process Applied to Queues: Single Server Case, Oper. Res., 25, pp. 662–674.Google Scholar
  8. 151.
    Shanthikumar, G.J. and Sumita, U. (1987) Convex Ordering of Sojourn Times in Single Server Queues: Extremal Properties of FIFO and LIFO Disciplines, J. Appl. Probab., 24.Google Scholar
  9. 128.
    Müller, A. and Stoyan, D. (2002) Stochastic Models and Risks, Wiley, New York.zbMATHGoogle Scholar
  10. 144.
    Rüschendorf, L. (1981) Ordering of Distributions and Rearrangement of Functions, Ann. Probab., 2, pp. 276–283.Google Scholar
  11. 108.
    Lindvall, T. (1992) Lectures on the Coupling Method, Wiley, New York.zbMATHGoogle Scholar
  12. 20.
    Baccelli, F. and Makowski, A.M. (1992) Stochastic Orders Related with Renewal Processes,University of Maryland, SRC-TR-92–3.Google Scholar
  13. 140.
    Rogozin, B.A. (1966) Some Extremal Problems in Queueing Theory, Theor. Prob. Appl. and its Appl. 11, pp. 144–151.Google Scholar
  14. 75.
    Humblet, P. (1982) Determinism Minimizes Waiting Times in Queues, Technical Report, LIDS - Department of Electrical Engineering and Computer Science, MIT, ( MA).Google Scholar
  15. 72.
    Hajek, B. (1985) Extremal Splittings of Point Processes, Math. Oper. Res. 10, 4, pp. 543–556.Google Scholar
  16. 70.
    Halfin, S and Whitt, W. (1989) An Extremal Property of the FIFO Discipline via and Ordinal Version of L = AW, Stoch. Models, 5, pp. 515–529.MathSciNetCrossRefzbMATHGoogle Scholar
  17. 159.
    Stoyan, D. (1983) Comparison Methods for Queues and Other Stochastic Models, English Edition, Wiley, New York.Google Scholar
  18. 128.
    Müller, A. and Stoyan, D. (2002) Stochastic Models and Risks, Wiley, New York.zbMATHGoogle Scholar
  19. 58.
    Esary, J.D., Proschan, F. and Walkup, D.W. (1967) Association of Random Variables, with Applications, Ann. Math. Stat. 38, pp. 1466–1474.Google Scholar
  20. 58.
    Esary, J.D., Proschan, F. and Walkup, D.W. (1967) Association of Random Variables, with Applications, Ann. Math. Stat. 38, pp. 1466–1474.Google Scholar
  21. 114.
    Little, J. (1961) A Proof for the Queueing Formula L = AT Oper. Res., 9, pp. 383–387.zbMATHGoogle Scholar
  22. 111.
    Little, J. (1961) A Proof for the Queueing Formula L = AT Oper. Res., 9, pp. 383–387.MathSciNetzbMATHGoogle Scholar
  23. 72.
    Hajek, B. (1985) Extremal Splittings of Point Processes, Math. Oper. Res. 10, 4, pp. 543–556.Google Scholar
  24. 3.
    Altman, E., Gaujal, B. and Hordijk, A. (2002) Discrete Event Control of Stochastic Networks: Multimodularity and Regularity,Springer-Verlag, to appear.Google Scholar
  25. 79.
    Jean-Marie, A. and Liu, Z. (1992) Stochastic Comparisons for Queueing Models via Random Sums and Intervals, Adv. Appl. Probab., 24, pp. 960–985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • François Baccelli
    • 1
  • Pierre Brémaud
    • 2
  1. 1.Ecole Normale Supérieure, LIENSINRIA-ENSParis Cedex 05France
  2. 2.School of Computer and Communication SystemsÉcole Polytechnique Fédérale de LausanneÉcublensSwitzerland

Personalised recommendations