By Topic

On queueing with customer impatience until the end of service

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Movaghar, A. ; Dept. of Comput. Eng., Sharif Univ. of Technol., Tehran, Iran

We study queueing systems where customers have strict deadlines until the end of their service. An analytic method is given for the analysis of a class of such queues, namely, M(n)/M/1+G models with ordered service. These are single-server queues with state-dependent Poisson arrival process, exponential service times, FCFS service discipline, and general customer impatience. We derive a closed-form solution for the conditional probability density function of the offered sojourn time, given the number of customers in the system. This is a novel result that has not been known before. Using this result, we show how the probability measure induced by the offered sojourn time is computed and consequently how performance measures such as the probability of missing deadline and the probability of blocking are obtained. This is further illustrated through a numerical example

Published in:

Computer Performance and Dependability Symposium, 2000. IPDS 2000. Proceedings. IEEE International

Date of Conference: