Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-27T02:21:43.680Z Has data issue: false hasContentIssue false
  • English
  • Français

Complementary generating functions for the MX/GI/1/k and GI/My/1/K queues and their application to the comparison of loss probabilities

Published online by Cambridge University Press:  14 July 2016

Masakiyo Miyazawa
Masakiyo Miyazawa*
Affiliation:
Science University of Tokyo
*
∗Postal address: Department of Information Sciences, Science University of Tokyo, Noda-city, Chiba, 278, Japan.
Get access Rights & Permissions [Opens in a new window]

Abstract

A direct proof is presented for the fact that the stationary system queue length distribution just after the service completion epochs in the Mx/GI/1/k queue is given by the truncation of a measure on Z+ = {0, 1, ·· ·}. The related truncation formulas are well known for the case of the traffic intensity ρ < 1 and for the virtual waiting time process in M/GI/1 with a limited waiting time (Cohen (1982) and Takács (1974)). By the duality of GI/MY/1/k to Mx/GI/1/k + 1, we get a similar result for the system queue length distribution just before the arrival of a customer in GI/MY/1/k. We apply those results to prove that the loss probabilities of Mx/GI/1/k and GI/MY/1/k are increasing for the convex order of the service time and interarrival time distributions, respectively, if their means are fixed.

Keywords

FINITE QUEUETRUNCATIONBATCH ARRIVALBATCH SERVICELOSS PROBABILITYCONVEX ORDERDUALITY
Type
Research Papers
Information
Journal of Applied Probability , Volume 27 , Issue 3 , September 1990 , pp. 684 - 692
Copyright
Copyright © Applied Probability Trust 1990 

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.)

References

Bagchi, T. and Templeton, J. G. C. (1973) A note on the MX/GY/1, K bulk queueing system. J. Appl. Prob. 10, 901–906.Google Scholar
Cohen, J. W. (1982) The Single Server Queue. North-Holland, Amsterdam.Google Scholar
Feller, W. (1968) An Introduction to Probability Theory and Its Applications. Vol. I, Wiley, New York.Google Scholar
Keilson, J. (1966) The ergodic queue length distribution for queueing systems with finite capacity. J. R. Statist. Soc. B28, 190–201.Google Scholar
Hooghiemstra, G. (1987) A path construction for the virtual waiting time of an M/G/1 queue. Statist. Neerlandia 41, 175–181.Google Scholar
Miyazawa, M. (1989) Comparison of the loss probability of GIx/GI/1/k queues with a common traffic intensity. J. Operat. Res. Soc. Japan 32, 505–516.Google Scholar
Miyazawa, M. and Shanthikumar, J. G. (1990) Monotonicity of the loss probability of single server finite queue with respect to convex order of arrival or service processes. Submitted.Google Scholar
Stoyan, D. (1983) Comparison Methods for Queues and Other Stochastic Models, edited with revision by Daley, D. J. Wiley, New York.Google Scholar
Takács, L. (1974) A single-server queue with limited virtual waiting time. J. Appl. Prob. 11, 612–617.Google Scholar
Tijms, H. C. (1986) Stochastic Modelling and Analysis. Wiley, New York.Google Scholar
Willmot, G. E. (1988) A note on the equilibrium M/G/1 queue length. J. Appl. Prob. 25, 228–231.Google Scholar