Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
  • Home
Hostname: page-component-559fc8cf4f-6f8dk Total loading time: 0.231 Render date: 2021-03-02T13:42:03.262Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }
EnglishFrançais
Journal of Applied Probability Journal of Applied Probability

Article contents

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

Part of: Computer system organization Special processes

Published online by Cambridge University Press:  30 March 2016

Ken'ichi Kawanishi  and
Tetsuya Takine
Ken'ichi Kawanishi
Affiliation:
Gunma University
Tetsuya Takine
Affiliation:
Osaka University
Corresponding
E-mail address:
kawanisi@cs.gunma-u.ac.jp
takine@comm.eng.osaka-u.ac.jp
Save pdf (0.06 mb)
Rights & Permissions[Opens in a new window]

Abstract

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.

Keywords

PH/M/c queue deterministic impatience time virtual waiting time matrix exponential form

MSC classification

Primary: 60K25: Queueing theory
Secondary: 68M20: Performance evaluation; queueing; scheduling
Type
Short Communications
Information
Journal of Applied Probability , Volume 52 , Issue 3 , September 2015 , pp. 899 - 903
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, 309–325.CrossRefGoogle 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, 895–908.CrossRefGoogle 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

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 46 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 2nd March 2021. This data will be updated every 24 hours.

Access
1 Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

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

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

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

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

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

Reply to: Submit a response

Your details

Conflicting interests

Do you have any conflicting interests? *