Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-23T09:40:29.405Z Has data issue: false hasContentIssue false
  • English
  • Français

Gated, Exhaustive, Parallel Service

Published online by Cambridge University Press:  27 July 2009

Sid Browne ,
E. G. CoffmanJR. ,
E. N. Gilbert  and
Paul E. Wright
Sid Browne
Affiliation:
Graduate School of Business Administration Columbia University New York, New York 10027
E. G. CoffmanJR.
Affiliation:
AT&T Bell Laboratories Murray Hill, New Jersey 07974
E. N. Gilbert
Affiliation:
AT&T Bell Laboratories Murray Hill, New Jersey 07974
Paul E. Wright
Affiliation:
AT&T Bell Laboratories Murray Hill, New Jersey 07974
Get access Rights & Permissions [Opens in a new window]

Abstract

We analyze gated, exhaustive service of an infinite-server system with vacations. Customers enter a queue in a Poisson stream. The servers, working in parallel, serve customers in stages. A stage begins with all customers transferred from the queue to the servers (the gate opens). The servers then begin serving these customers, all simultaneously. The stage ends when their services are completed. Service is exhaustive because the servers must again examine the queue to see if any new customers arrived during the last stage. If there are any, a new stage begins. If there are none, the servers move on to other work. The time spent away from the queue is called vacation time. The queue may represent a node or station in a data transmission network and the servers may be communication channels.

We analyze the equilibrium behavior of the number of requests served during a stage for general service and vacation time distributions. This analysis leads to the solution of a Fredholm integral equation of the second kind. We find conditions under which the system is stable and compute bounds on performance metrics of interest. Approximate techniques are introduced and tested. Finally, an extension to polling systems is studied.

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 6 , Issue 2 , April 1992 , pp. 217 - 239
Copyright
Copyright © Cambridge University Press 1992

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

References

Kleinrock, L. (1975). Queueing systems, Vol. I. New York: Wiley.Google Scholar
Kress, R. (1989). Linear integral equations, Vol. 82. Applied Mathematical Sciences. New York: Springer. Verlag.CrossRefGoogle Scholar
Lubachevsky, B.D. (1989). Stability of the bounded-lag distributed discrete event simulation. In Unger, B. & Fujimoto, R. (eds.), Distributed simulation 1989. San Diego: Society for Computer Simulation International, pp. 100–107.Google Scholar
Takagi, H. (1986). Analysis of polling systems. Cambridge, MA: MIT Press.Google Scholar
Wolff, R. (1982). Poisson arrivals see time averages. Operations Research 30: 232–233.CrossRefGoogle Scholar