Hostname: page-component-89b8bd64d-46n74 Total loading time: 0 Render date: 2026-05-09T03:20:36.147Z Has data issue: false hasContentIssue false

The M/G/1 queue with negative customers

Published online by Cambridge University Press:  01 July 2016

Peter G. Harrison*
Affiliation:
Imperial College
Edwige Pitel*
Affiliation:
Imperial College
*
Postal address: Department of Computing, Imperial College, 180 Queen's Gate, London SW7 2BZ, UK.
Postal address: Department of Computing, Imperial College, 180 Queen's Gate, London SW7 2BZ, UK.

Abstract

We derive expressions for the generating function of the equilibrium queue length probability distribution in a single server queue with general service times and independent Poisson arrival streams of both ordinary, positive customers and negative customers which eliminate a positive customer if present. For the case of first come first served queueing discipline for the positive customers, we compare the killing strategies in which either the last customer in the queue or the one in service is removed by a negative customer. We then consider preemptive-restart with resampling last come first served queueing discipline for the positive customers, combined with the elimination of the customer in service by a negative customer—the case of elimination of the last customer yields an analysis similar to first come first served discipline for positive customers. The results show different generating functions in contrast to the case where service times are exponentially distributed. This is also reflected in the stability conditions. Incidently, this leads to a full study of the preemptive-restart with resampling last come first served case without negative customers. Finally, approaches to solving the Fredholm integral equation of the first kind which arises, for instance, in the first case are considered as well as an alternative iterative solution method.

MSC classification

Information

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 1996 

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