Journal of Applied Probability · 1994 · 298 citations · 49 references
BusinessMathematicsProbability TheoryQueuing TheoryStochastic ProcessesMarkov ProcessesQueueing ProcessesQueueing SystemsQueueing TheorySingle-server QueuesWaiting Time AnalysisAdmission ControlAsymptotic Analysis Of QueuesAsymptotic Queueing TheoryInterarrival Time DistributionsInterarrival TimesQueuesSingle-server Queue AsymptoticsSteady-state Distribution
We consider the standard single-server queue with unlimited waiting space and the first-in first-out service discipline, but without any explicit independence conditions on the interarrival and service times. We find conditions for the steady-state waiting-time distribution to have asymptotics of the form x –1 log P ( W > x ) → – θ ∗as x → ∞for θ ∗ > 0. We require only stationarity of the basic sequence of service times minus interarrival times and a Gärtner–Ellis condition for the cumulant generating function of the associated partial sums, i.e. n –1 log E exp ( θS n ) → ψ ( θ ) as n → ∞, plus regularity conditions on the decay rate function ψ . The asymptotic decay rate θ is the root of the equation ψ ( θ ) = 0. This result in turn implies a corresponding asymptotic result for the steady-state workload in a queue with general non-decreasing input. This asymptotic result covers the case of multiple independent sources, so that it provides additional theoretical support for a concept of effective bandwidths for admission control in multiclass queues based on asymptotic decay rates.
49
Applied Probability and Queues.
Upendra Dave, Søren Asmussen · Journal of the Operational Research Society · 1987 · 2.8K citations