Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-10T16:14:13.175Z Has data issue: false hasContentIssue false

On ross's conjectures about queues with non-stationary poisson arrivals

Published online by Cambridge University Press:  14 July 2016

D. P. Heyman*
Affiliation:
Bell Laboratories
*
Postal address: Bell Laboratories, Bldg. WB, Room 1G311, Holmdel, NJ 07733, U.S.A.

Abstract

Ross (1978) conjectured that the average delay in a single-server queue is larger when the arrival process is a non-stationary Poisson process than when it is a stationary Poisson process with the same rate. We present an example where equality obtains. When the number of waiting-positions is finite, Ross conjectured that the proportion of lost customers is greater in the nonstationary case. We present a counterexample to this conjecture.

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1982 

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

Fond, S. and Ross, S. M. (1978) A heterogeneous arrival and service loss model. Naval Res. Logist. Quart. 25, 483488.Google Scholar
Heyman, D. P. and Stidham, S. (1980) The relation between customer and time averages in queues. Operat. Res. 28, 983994.CrossRefGoogle Scholar
Niu, S.-C. (1980) A single server queueing loss model with heterogeneous arrival and service. Operat. Res. 28, 584593.Google Scholar
Prabhu, N. U. (1965) Queues and Inventories. Wiley, New York.Google Scholar
Rolski, T. (1981) Queues with non-stationary input stream: Ross's conjecture. Adv. Appl. Prob. 13, 603618.Google Scholar
Ross, S. (1978) Average delay in queues with non-stationary Poisson arrivals. J. Appl. Prob. 15, 602609.Google Scholar
Takács, L. (1969) On Erlang's formula. Ann. Math. Statist. 40, 7178.Google Scholar