Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-23T20:08:36.454Z Has data issue: false hasContentIssue false
  • English
  • Français

THE MX/D/c BATCH ARRIVAL QUEUE

Published online by Cambridge University Press:  22 June 2005

Geert Jan Franx
Geert Jan Franx
Affiliation:
Department of Mathematics, Vrije Universiteit Amsterdam, De Boelelaan 1081, 1081HV Amsterdam, The Netherlands, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

A surprisingly simple and explicit expression for the waiting time distribution of the MX/D/c batch arrival queue is derived by a full probabilistic analysis, requiring neither generating functions nor Laplace transforms. Unlike the solutions known so far, this expression presents no numerical complications, not even for high traffic intensities.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 19 , Issue 3 , July 2005 , pp. 345 - 349
Copyright
© 2005 Cambridge University Press

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

REFERENCES

Kuczura, A. (1973). Batch input to a multiserver queue with constant service times. The Bell System Technical Journal 52(1).CrossRefGoogle Scholar
Tijms, H.C. (1994). Stochastic models, an algorithmic approach. New York: Wiley.
Wolff, R.W. (1982). Poisson arrivals see time averages. Operations Research 30: 223–231.Google Scholar
Wolff, R.W. (1989). Stochastic modelling and the theory of queues. Englewood Cliffs, NJ: Prentice-Hall.