By Topic

Retrials and balks (queueing)

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)
E. N. Gilbert ; AT&T Bell Lab., Murray Hill, NJ, USA

An overloaded service system may reject customers if it has no queue to store them. In practice, rejected customers return later to make retrials and may not leave permanently (balk) until several retrials fail. A single-server system with Poisson arrivals is examined in which rejected customers balk or make retrials according to a simple probabilistic model. Customer service times are independent random variables, all with the same given distribution function b(t). The stationary probability distribution for the number of customers waiting to make retrials satisfies a complicated functional equation. The solution is elusive in general but can be obtained for special b(t) (exponential distribution) or special values of model parameters. When the solution cannot be found, bounds on the fraction of customers served can be obtained

Published in:

IEEE Transactions on Information Theory  (Volume:34 ,  Issue: 6 )