1984SIAM Journal on Applied MathematicsRequires access

Two Parallel Queues Created by Arrivals with Two Demands I

Leopold Flatto, Sebastian Hahn

Open publisher page 327 citations

Abstract

We analyze the double queue that arises when arriving customers simultaneously place two demands handled independently by two servers. It is assumed that the customer arrivals form a Poisson process with mean 1, the servers have exponential service times with rates $\alpha ,\beta $ and $1 < \alpha \leqq \beta $, which implies stability of the queue. The equations for the equilibrium probabilities $p_{ij} = P$ (i customers in $\alpha $-queue, j customers in $\beta $-queue) are converted into a functional equations for $P(z,w) = \sum p_{ij} z^i w^j $, which exhibits a relation between $P(z,0)$, $P(0,w)$ on the portion $| z |$, $| w |\leqq 1$ of $S = \{ (z,w):(1 + \alpha + \beta )zw - \alpha w - \beta z - z^2 w^2 = 0\} $. S is a Riemann surface of genus 1 which is parametrized by a pair of elliptic functions $z = z(t)$, $w = w(t)$. The functional equation for $P(z,w)$ is converted into a set of conditions on $P(z(t),0)$, $P(0,w(t))$, which in turn lead to the determination of $P(z,w)$. From this, one obtains asymptotic formulas for $p_{ij} $ as either i or $j \to \infty $.

About this research paper

What this paper is about

We analyze the double queue that arises when arriving customers simultaneously place two demands handled independently by two servers. It is assumed that the customer arrivals form a Poisson process with mean 1, the servers have exponential service times with rates $\alpha ,\beta $ and $1 < \alpha \leqq \beta $, which implies stability of the queue. The equations for the equilibrium probabilities $p_{ij} = P$ (i customers in $\alpha $-queue, j customers in $\beta $-queue) are converted into a functional equations for $P(z,w) = \sum p_{ij} z^i w^j $, which exhibits a relation between $P(z,0)$, $P(0,w)$ on the portion $| z |$, $| w |\leqq 1$ of $S = \{ (z,w):(1 + \alpha + \beta )zw - \alpha w - \beta z - z^2 w^2 = 0\} $. S is a Riemann surface of genus 1 which is parametrized by a pair of elliptic functions $z = z(t)$, $w = w(t)$. The functional equation for $P(z,w)$ is converted into a set of conditions on $P(z(t),0)$, $P(0,w(t))$, which in turn lead to the determination of $P(z,w)$. From this, one obtains asymptotic formulas for $p_{ij} $ as either i or $j \to \infty $.

Why it matters

OpenAlex reports 327 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 analyze the double queue that arises when arriving customers simultaneously place two demands handled independently by two servers. It is assumed that the customer arrivals form a Poisson process with mean 1, the servers have exponential service times with rates $\alpha ,\beta $ and $1 < \alpha \leqq \beta $, which implies stability of the queue. The equations for the equilibrium probabilities $p_{ij} = P$ (i customers in $\alpha $-queue, j customers in $\beta $-queue) are converted into a functional equations for $P(z,w) = \sum p_{ij} z^i w^j $, which exhibits a relation between $P(z,0)$, $P(0,w)$ on the portion $| z |$, $| w |\leqq 1$ of $S = \{ (z,w):(1 + \alpha + \beta )zw - \alpha w - \beta z - z^2 w^2 = 0\} $. S is a Riemann surface of genus 1 which is parametrized by a pair of elliptic functions $z = z(t)$, $w = w(t)$. The functional equation for $P(z,w)$ is converted into a set of conditions on $P(z(t),0)$, $P(0,w(t))$, which in turn lead to the determination of $P(z,w)$. From this, one obtains asymptotic formulas for $p_{ij} $ as either i or $j \to \infty $.

Key concepts: Mathematics, Combinatorics, Queue, BETA (programming language), Burke's theorem, Mathematical analysis, Queueing theory, Fork–join queue

Related papers

Back to paper searchBrowse research topicsOriginal source
Two Parallel Queues Created by Arrivals with Two Demands I — Research Paper | ScholarLens