arXiv Analytics

Sign in

arXiv:1404.5549 [math.PR]AbstractReferencesReviewsResources

On queues with service and interarrival times depending on waiting times

Onno J. Boxma, Maria Vlasiou

Published 2014-04-22Version 1

We consider an extension of the standard G/G/1 queue, described by the equation $W\stackrel{\mathcal{D}}{=}\max\{0, B-A+YW\}$, where $\mathbb{P}[Y=1]=p$ and $\mathbb{P}[Y=-1]=1-p$. For $p=1$ this model reduces to the classical Lindley equation for the waiting time in the G/G/1 queue, whereas for $p=0$ it describes the waiting time of the server in an alternating service model. For all other values of $p$ this model describes a FCFS queue in which the service times and interarrival times depend linearly and randomly on the waiting times. We derive the distribution of $W$ when $A$ is generally distributed and $B$ follows a phase-type distribution, and when $A$ is exponentially distributed and $B$ deterministic.

Comments: 19 pages, 1 figure, 24 references
Journal: Queueing Systems, 56(3-4), 121-132, August 2007
Categories: math.PR
Subjects: 60K25
Related articles: Most relevant | Search more
arXiv:1412.1203 [math.PR] (Published 2014-12-03)
New Representations for G/G/1 Waiting Times
arXiv:0809.4275 [math.PR] (Published 2008-09-24, updated 2009-12-10)
Heavy-traffic limits for waiting times in many-server queues with abandonment
arXiv:0802.3485 [math.PR] (Published 2008-02-24, updated 2008-08-08)
The waiting time for m mutations