Annals of Operations Research

, Volume 48, Issue 5, pp 493–511 | Cite as

Geometric equilibrium distributions for queues with interactive batch departures

  • W. Henderson
  • B. S. Northcote
  • P. G. Taylor
Networks With Negative Customers


Gelenbe et al. [1, 2] consider single server Jackson networks of queues which contain both positive and negative customers. A negative customer arriving to a nonempty queue causes the number of customers in that queue to decrease by one, and has no effect on an empty queue, whereas a positive customer arriving at a queue will always increase the queue length by one. Gelenbe et al. show that a geometric product form equilibrium distribution prevails for this network. Applications for these types of networks can be found in systems incorporating resource allocations and in the modelling of decision making algorithms, neural networks and communications protocols.

In this paper we extend the results of [1, 2] by allowing customer arrivals to the network, or the transfer between queues of a single positive customer in the network to trigger the creation of a batch of negative customers at the destination queue. This causes the length of the queue to decrease by the size of the created batch or the size of the queue, whichever is the smallest. The probability of creating a batch of negative customers of a particular size due to the transfer of a positive customer can depend on both the source and destination queue.

We give a criterion for the validity of a geometric product form equilibrium distribution for these extended networks. When such a distribution holds it satisfies partial balance equations which are enforced by the boundaries of the state space. Furthermore it will be shown that these partial balance equations relate to traffic equations for the throughputs of the individual queues.


Product form geometric distribution batch departures 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. Gelenbe, Product form networks with negative and positive customers, J. Appl. Prob. 28 (1991) 656–663.Google Scholar
  2. [2]
    E. Gelenbe, P. Glynn and K. Sigman, Queues with negative arrivals, J. Appl. Prob. 28 (1991) 245–250.Google Scholar
  3. [3]
    E. Gelenbe and R. Schassberger, Note on the stability ofG-networks, Research Report 90-8, Université René Descartes, Paris (1990).Google Scholar
  4. [4]
    E. Gelenbe, Negative customers with batch removal, private communication.Google Scholar
  5. [5]
    J. Jackson, Networks of waiting lines, Oper. Res. 5 (1957) 518–521.Google Scholar
  6. [6]
    E. Kandel and J. Schwartz,Principles of Neural Science (Elsevier, Amsterdam, 1985).Google Scholar
  7. [7]
    S.M. Ross,Introduction to Probability Models, 4th ed. (Academic Press, 1989).Google Scholar
  8. [8]
    P. Whittle, Equilibrium distributions for an open migration process, J. Appl. Prob. 5 (1968) 567–571.Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1994

Authors and Affiliations

  • W. Henderson
    • 1
  • B. S. Northcote
    • 1
  • P. G. Taylor
    • 1
  1. 1.Teletraffic Research Centre, Department of Applied MathematicsUniversity of AdelaideAdelaideAustralia

Personalised recommendations