Indexed metadata

Two Parallel Queues Created by Arrivals with Two Demands I

L. Flatto, S. Hahn

Source record

Source: Crossref

Published: Oct 1, 1984

DOI: 10.1137/0144074

Open original source ↗

Source 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<α≦β1 < \alpha \leqq \beta , which implies stability of the queue. The equations for the equilibrium probabilities pij=Pp_{ij} = P (i customers in α\alpha -queue, j customers in β\beta -queue) are converted into a functional equations for P(z,w)=∑pijziwjP(z,w) = \sum p_{ij} z^i w^j , which exhibits a relation between P(z,0)P(z,0), P(0,w)P(0,w) on the portion ∣z∣| z |, ∣w∣≦1| w |\leqq 1 of S={(z,w):(1+α+β)zw−αw−βz−z2w2=0}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)z = z(t), w=w(t)w = w(t). The functional equation for P(z,w)P(z,w) is converted into a set of conditions on P(z(t),0)P(z(t),0), P(0,w(t))P(0,w(t)), which in turn lead to the determination of P(z,w)P(z,w). From this, one obtains asymptotic formulas for pijp_{ij} as either i or j→∞j \to \infty .

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.