Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T07:24:59.389Z Has data issue: false hasContentIssue false

Sojourn times in single-server queues by negative customers

Published online by Cambridge University Press:  14 July 2016

P. G. Harrison
Affiliation:
Imperial College, London
E. Pitel*
Affiliation:
Imperial College, London
*
∗ Postal address for both authors: Department of Computing, Imperial College, University of London, 180 Queen's Gate, London SW7 2BZ, UK.

Abstract

We derive expressions for the Laplace transform of the sojourn time density in a single-server queue with exponential service times and independent Poisson arrival streams of both ordinary, positive customers and negative customers which eliminate a positive customer if present. We compare first-come first-served and last-come first-served queueing disciplines for the positive customers, combined with elimination of the last customer in the queue or the customer in service by a negative customer. We also derive the corresponding result for processor-sharing discipline with random elimination. The results show differences not only in the Laplace transforms but also in the means of the distributions, in contrast to the case where there are no negative customers. The various combinations of queueing discipline and elimination strategy are ranked with respect to these mean values.

MSC classification

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1993 

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

Article purchase

Temporarily unavailable