1990Journal of Applied ProbabilityRequires access

Strong approximations for multiple channel queues in heavy traffic

Hanqin Zhang, Hsu Guanghui, Wang Rongxin

Open publisher page 2 citations

Abstract

We prove strong approximations for multiple channel queues in heavy traffic. Strong approximations are given for the waiting time and queue length processes, and for embedded sequences associated with the length process.

About this research paper

What this paper is about

We prove strong approximations for multiple channel queues in heavy traffic. Strong approximations are given for the waiting time and queue length processes, and for embedded sequences associated with the length process.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We prove strong approximations for multiple channel queues in heavy traffic. Strong approximations are given for the waiting time and queue length processes, and for embedded sequences associated with the length process.

Key concepts: Queue, Heavy traffic, Mathematics, Approximations of π, Channel (broadcasting), Queueing theory, Applied mathematics, Statistics

Related papers

Back to paper searchBrowse research topicsOriginal source
Strong approximations for multiple channel queues in heavy traffic — Research Paper | ScholarLens