Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-14T23:15:52.111Z Has data issue: false hasContentIssue false

A convexity result for single-server exponential loss systems with non-stationary arrivals

Published online by Cambridge University Press:  14 July 2016

Antony Svoronos*
Affiliation:
Columbia University
Linda Green
Affiliation:
Columbia University
*
Postal address: Graduate School of Business, Uris Hall, Columbia University, New York, NY 10027, USA.

Abstract

We consider single-server loss systems with exponential service times and non-stationary Poisson input. We prove that if the arrival rate is given by a periodic function, the proportion of lost customers is convex increasing in the amplitude.

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1988 

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

Heyman, D. P. (1982) On Ross's conjectures about queues with non-stationary Poisson arrivals. J. Appl. Prob. 19, 245249.CrossRefGoogle Scholar
Heyman, D. P. and Whitt, W. (1984) The asymptotic behavior of queues with time-varying arrival rates. J. Appl. Prob. 21, 143156.CrossRefGoogle Scholar
Rolski, T. (1981) Queues with non-stationary input stream: Ross's conjecture. Adv. Appl. Prob. 13, 603618.CrossRefGoogle Scholar
Rolski, T. (1983) Comparison theorems for queues with dependent interarrival times. Proceedings of the International Seminar , Paris, France.Google Scholar
Ross, S. M. (1978) Average delay in queues with non-stationary Poisson arrivals. J. Appl. Prob. 15, 602609.CrossRefGoogle Scholar