Approximations for Superposition Arrival Processes in Queues

G. F. Newell
Additional contact information
G. F. Newell: Department of Civil Engineering, University of California, Berkeley, California 94720

Management Science, 1984, vol. 30, issue 5, 623-632

Abstract: S. L. Albin has described extensive simulations of queue behavior for a system with a single server and an arrival process that is a superposition of n renewal processes. The simulations show, among other things, that as n increases for a fixed traffic intensity \rho, the queue behavior approaches that of the M/M/1 system. The rate of convergence, however, becomes much slower as the traffic intensity \rho comes closer to 1. Several qualitative effects shown in the simulations are explained here. In particular it is shown that the approach to the M/M/1 system requires that n(1 - \rho) 2 \gg 1.

Keywords: queues; approximations; superposition arrival processes (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.30.5.623 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:30:y:1984:i:5:p:623-632

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().