Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-29T02:49:08.618Z Has data issue: false hasContentIssue false

A note on the virtual waiting time in the stationary PH/M/c+D queue

Published online by Cambridge University Press:  30 March 2016

Ken'ichi Kawanishi*
Affiliation:
Gunma University
Tetsuya Takine*
Affiliation:
Osaka University
*
Postal address: Division of Electronics and Informatics, Gunma University, Kiryu, 376-8515, Japan. Email address: [email protected]
∗∗ Postal address: Department of Information and Communications Technology, Graduate School of Engineering, Osaka University, Suita, 565-0871, Japan. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper we consider the stationary PH/M/c queue with deterministic impatience times (PH/M/c+D). We show that the probability density function of the virtual waiting time takes the form of a matrix exponential whose exponent is given explicitly by system parameters.

Type
Short Communications
Copyright
Copyright © 2015 by the Applied Probability Trust 

References

Choi, B. D., Kim, B. and Zhu, D. (2004). MAP/M/c queue with constant impatient time. Math. Operat. Res. 29, 309325.Google Scholar
Sakuma, Y. and Takine, T. (2015). Multi-class M/PH/1 queues with deterministic impatience times. Submitted.Google Scholar
Swensen, A. R. (1986). On a GI/M/c queue with bounded waiting times. Operat. Res. 34, 895908.Google Scholar
Tijms, H. C. (1994). Stochastic Models: An Algorithmic Approach, John Wiley, Chichester.Google Scholar
Van Loan, C. F. (1978). Computing integrals involving the matrix exponential. IEEE Trans. Automatic Control 23, 395-404.CrossRefGoogle Scholar