On Poisson Approximations for Superposition Arrival Processes in Queues

S. L. Albin
Additional contact information
S. L. Albin: Rutgers University

Management Science, 1982, vol. 28, issue 2, 126-137

Abstract: We report on simulations of \Sigma i GI i /M/1 queues; the arrival process is the superposition (sum) of up to 1024 i.i.d. renewal processes and there is a single exponential server. As one might anticipate, the simulation estimate of the expected number of customers in a \Sigma i GI i /M/1 queueing system approaches the expected number in an M/M/1 queueing system as the number of arrival processes, n, increases. However, for a given n, the difference between the expected numbers in the M/M/1 and \Sigma i GI i /M/1 queueing systems dramatically increases as the traffic intensity increases from \rho = 0.5 to \rho = 0.9. This difference is approximated by a formula which is a function of the traffic intensity, the number of component arrival processes and the squared coefficient of variation of the component interarrival times.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.28.2.126 (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:28:y:1982:i:2:p:126-137

Access Statistics for this article

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