Hostname: page-component-7dd5485656-glrdx Total loading time: 0 Render date: 2025-10-30T20:33:00.352Z Has data issue: false hasContentIssue false
  • English
  • Français

Monotonicity of the Loss Probabilities of Single Server Finite Queues with Respect to Convex Order of Arrival or Service Processes

Published online by Cambridge University Press:  27 July 2009

Masakiyo Miyazawa  and
J. George Shanthikumar
Masakiyo Miyazawa
Affiliation:
Science University of Tokyo
J. George Shanthikumar
Affiliation:
University of California, Berkeley
Get access Rights & Permissions [Opens in a new window]

Abstract

The loss probabilities of customers in the Mx/GI/1/k, GI/Mx/l/k and their related queues such as server vacation models are compared with respect to the convex order of several characteristics, for example, batch size, of the arrival or service process. In the proof, we give a characterization of a truncation expression for a stationary distribution of a finite Markov chain, which is interesting in itself.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 5 , Issue 1 , January 1991 , pp. 43 - 52
Copyright
Copyright © Cambridge University Press 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

Chang, C.S., Chao, X., & Pinedo, M. (1988). Some inequalities for queues with batch Poisson arrivals. Technical Report, Department of Industrial Engineering and Operations Research, Columbia University, New York.Google Scholar
Chang, C.S., Chao, X., Pinedo, M., & Shanthikumar, J.G. (1990). Stochastic convexity for multidimensional processes and its applications. Technical Report, Department of Industrial Engineering and Operations Research, Columbia University, New York.Google Scholar
Doshi, B.T. (1986). Queueing systems with vacations—A survey. Queueing Systems 1: 29–66.CrossRefGoogle Scholar
Franken, P., König, D., Arndt, U., & Schmidt, V. (1982). Queues and point processes. New York: Wiley.Google Scholar
Levy, Y. and Yechiali, U. (1975). Utilization of idle time in an M/G/l queueing system. Management Science 22: 202–211.CrossRefGoogle Scholar
Miyazawa, M. (1989). Comparison of the loss probability of the Glx/GI/l/k queues with a common traffic intensity. Journal of the Operations Research Society of Japan 32: 505–5166.Google Scholar
Miyazawa, M. (1990). Complementary generating functions for Mx/Gl/l/k and Gl/MY/l/k queues and their applications to the comparison of loss probabilities. (to appear in Journal of Applied Probability).CrossRefGoogle Scholar
Shaked, M. & Shanthikumar, J.G. (1988a). Temporal stochastic convexity and concavity. Stochastic Processes and Their Applications 27: 1–20.CrossRefGoogle Scholar
Shaked, M. & Shanthikumar, J.G. (1988b). Stochastic convexity and its applications Advanced Applied Probability 20: 427–446.CrossRefGoogle Scholar
Shanthikumar, J.G. (1988). On stochastic decomposition in M/G/l type of queues with generalized server vacations. Operations Research 36: 566–569.CrossRefGoogle Scholar