Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T19:54:42.477Z Has data issue: false hasContentIssue false

The virtual waiting time of the GI/G/1 queue in heavy traffic

Published online by Cambridge University Press:  01 July 2016

E. Kyprianou*
Affiliation:
University of Manchester

Extract

Investigations in the theory of heavy traffic were initiated by Kingman ([5], [6] and [7]) in an effort to obtain approximations for stable queues. He considered the Markov chains {W n i } of a sequence {Q i } of stable GI/G/1 queues, where W n i is the waiting time of the nth customer in the ith queueing system, and by making use of Spitzer's identity obtained limit theorems as first n → ∞ and then ρi ↑ 1 as i → ∞. Here &rHi is the traffic intensity of the ith queueing system. After Kingman the theory of heavy traffic was developed by a number of Russians mainly. Prohorov [10] considered the double sequence of waiting times {W n i } and obtained limit theorems in the three cases when n 1/2(ρi -1) approaches (i) - ∞, (ii) -δ and (iii) 0 as n → ∞ and i → ∞ simultaneously. The case (i) includes the result of Kingman. Viskov [12] also studied the double sequence {W n i } and obtained limits in the two cases when n 1/2(ρi − 1) approaches + δ and + ∞ as n → ∞ and i → ∞ simultaneously.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1971 

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