Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-25T04:07:26.589Z Has data issue: false hasContentIssue false
  • English
  • Français

Queues with negative arrivals

Published online by Cambridge University Press:  14 July 2016

Erol Gelenbe ,
Peter Glynn  and
Karl Sigman
Erol Gelenbe*
Affiliation:
University René Descartes
Peter Glynn*
Affiliation:
Stanford University
Karl Sigman*
Affiliation:
Columbia University
*
∗Postal address: Ecole des Hautes Etudes en Informatique, Université René Descartes (Paris V), 45 rue des Saints-Peres, 45006 Paris, France.
∗∗Postal address: Department of Operations Research, Stanford University, Stanford, CA 943054022, USA.
∗∗∗Postal address: Department of Industrial Engineering and Operations Research, Columbia University, New York NY 10027, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

We study single-server queueing models where in addition to regular arriving customers, there are negative arrivals. A negative arrival has the effect of removing a customer from the queue. The way in which this removal is specified gives rise to several different models. Unlike the standard FIFO GI/GI/1 model, the stability conditions for these new models may depend upon more than just the arrival and service rates; the entire distributions of interarrival and service times may be involved.

Keywords

STABILITYREMOVALS
Type
Short Communications
Information
Journal of Applied Probability , Volume 28 , Issue 1 , March 1991 , pp. 245 - 250
Copyright
Copyright © Applied Probability Trust 1991 

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

Footnotes

Research supported in part by CNRS-CS (French National Program on Parallel Computation).

Research supported by the U.S. Army Research Office under Contract DAAL-03-88-K-0063.

Research supported by NSF Grant DDM 895–7825.

References

[1] Cellary, W., Gelenbe, E. and Morzy, J. (1988) Concurrency Control in Distributed Databases. North-Holland, Amsterdam.Google Scholar
[2] Franken, P., Koenig, D., Arndt, U. and Schmidt, V. (1981) Queues and Point Processes. Akademie Verlag, Berlin.Google Scholar
[3] Gelenbe, E. (1991) Product form networks with negative and positive customers. J. Appl. Prob. 28(3).CrossRefGoogle Scholar
4 Gelenbe, E. and Pujolle, G. (1986) Introduction to Networks of Queues. Wiley, London.Google Scholar
[5] Gross, D. and Harris, C. M. (1985) Fundamentals of Queueing, 2nd edn. Wiley, New York.Google Scholar
[6] Kandel, E. C. and Schwartz, J. H. (1985) Principles of Neural Science. Elsevier, Amsterdam.Google Scholar
[7] Rumelhart, D. E., Mcclelland, J. L. and The Pdp Research Group (1986) Parallel Distributed Processing, Vols. I and II. Bradford Books and MIT Press, Cambridge, Mass.CrossRefGoogle Scholar
[8] Sigman, K. (1988) Queues as Harris recurrent Markov chains. Queueing Systems 3, 179–198.CrossRefGoogle Scholar
[9] Sigman, K. (1989) One-dependent regenerative processes and queues in continuous time. Math. Operat. Res. 15, 175–189.Google Scholar
[10] Tweedie, R. L. (1976) Criteria for classifying general Markov chains. Adv. Appl. Prob. 8, 737–771.CrossRefGoogle Scholar
[11] Wolff, R. W. (1989) Stochastic Modeling and the Theory of Queues. Prentice-Hall, Englewood Cliffs, NJ.Google Scholar