Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T07:36:41.901Z Has data issue: false hasContentIssue false

Exponential approximation of waiting time and queue size for queues in heavy traffic

Published online by Cambridge University Press:  01 July 2016

Władysław Szczotka*
Affiliation:
Wrocław University
*
∗ Postal address: Mathematical Institute, Wrocław University, Pl. Grunwaldzki 2/4, 50–384 Wrocław, Poland.

Abstract

An exponential approximation for the stationary waiting time distribution and the stationary queue size distribution for single-server queues in heavy traffic is given for a wide class of queues. This class contains for example not only queues for which the generic sequence, i.e. the sequence of service times and interarrival times, is stationary but also such queues for which the generic sequence is asymptotically stationary in some sense. The conditions ensuring the exponential approximation of the characteristics considered in heavy traffic are expressed in terms of the invariance principle for the stationary representation of the generic sequence and its first two moments.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1990 

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.)

Article purchase

Temporarily unavailable