Average Delay in Queues with Nonstationary Poisson Arrivals.
Abstract
One of the major difficulties in attempting to apply known queueing theory results to real problems is that almost always these results assume a time stationary Poisson arrival process, whereas in practice the actual process is almost invariably nonstationary. This paper considers single server infinite capacity queueing models in which the arrival process is a nonstationary process with an intensity function Lambda(t), t > or = 0, which is itself a random process. The average value of the intensity function exists and is equal to some constant, called lambda, qith probability 1. If the effect that the closer (Lambda(t), t > or = 0) is to the stationary Poisson process with rate Lambda then the smaller is the average customer delay, and then the conjecture is verified in a special case.
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1977
- Accession Number
- ADA041629
Entities
People
- Sheldon M. Ross
Organizations
- University of California, Berkeley