Two Parallel M/G/1 Queues Where Arrivals Join the System with the Smaller Buffer Content

Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier

Research output: Contribution to journalComment/debatepeer-review

12 Scopus citations

Abstract

We consider two parallel, infinite capacity, M/G/l queues characterized by (U1(t), U2(t)) with Uj(t) denoting the unfinished work (buffer content) in queue j. A new arrival is assigned to the queue with the smaller buffer content. We construct formal (as opposed to rigorous) asymptotic approximations to the joint stationary distribution of the Markov process (U1(t), U2(t)), treating separately the asymptotic limits of heavy traffic, light traffic, and large buffer contents. In heavy traffic, the stochastic processes U1(t) + U2(t) and U2(t) - U2(t) become independent, with the distribution of U1(t) + U2(t) identical to the heavy traffic waiting time distribution in the standard M/G/2 queue, and the distribution of U2(t) - U1(t) closely related to the tail of the service time density. In light traffic, we obtain a formal expansion of the stationary distribution in powers of the arrival rate.

Original languageEnglish (US)
Pages (from-to)1153-1158
Number of pages6
JournalIEEE Transactions on Communications
Volume35
Issue number11
DOIs
StatePublished - Nov 1987

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Two Parallel M/G/1 Queues Where Arrivals Join the System with the Smaller Buffer Content'. Together they form a unique fingerprint.

Cite this