Bridges and networks: Exact asymptotics

Type: Article

Publication Date: 2005-02-01

Citations: 34

DOI: https://doi.org/10.1214/105051604000000675

Abstract

We extend the Markov additive methodology developed in [Ann. Appl. Probab. 9 (1999) 110–145, Ann. Appl. Probab. 11 (2001) 596–607] to obtain the sharp asymptotics of the steady state probability of a queueing network when one of the nodes gets large. We focus on a new phenomenon we call a bridge. The bridge cases occur when the Markovian part of the twisted Markov additive process is one null recurrent or one transient, while the jitter cases treated in [Ann. Appl. Probab. 9 (1999) 110–145, Ann. Appl. Probab. 11 (2001) 596–607] occur when the Markovian part is (one) positive recurrent. The asymptotics of the steady state is an exponential times a polynomial term in the bridge case, but is purely exponential in the jitter case. We apply this theory to a modified, stable, two node Jackson network where server two helps server one when server two is idle. We derive the sharp asymptotics of the steady state distribution of the number of customers queued at each node as the number of customers queued at the server one grows large. In so doing we get an intuitive understanding of the companion paper [Ann. Appl. Probab. 15 (2005) 519–541] which gives a large deviation analysis of this problem using the flat boundary theory in the book by Shwartz and Weiss. Unlike the (unscaled) large deviation path of a Jackson network which jitters along the boundary, the unscaled large deviation path of the modified network tries to avoid the boundary where server two helps server one (and forms a bridge). In the fluid limit this bridge does collapse to a straight line, but the proportion of time spent on the flat boundary tends to zero. This bridge phenomenon is ubiquitous. We also treated the bathroom problem described in the Shwartz and Weiss book and found the bridge case is present. Here we derive the sharp asymptotics of the steady state of the bridge case and we obtain the results consistent with those obtained in [SIAM J. Appl. Math. (1984) 44 1041–1053] using complex variable methods.

Locations

  • arXiv (Cornell University) - View - PDF
  • DataCite API - View
  • The Annals of Applied Probability - View - PDF

Similar Works

Action Title Year Authors
+ Approximation of Excessive Backlog Probabilities of Two Tandem Queues 2018 Ali Devin Sezer
+ PDF Chat Large deviations of a modified Jackson network: Stability and rough asymptotics 2005 Robert D. Foley
David McDonald
+ PDF Chat Join the shortest queue: stability and exact asymptotics 2001 Robert D. Foley
David McDonald
+ Exit Probabilities and Balayage of Constrained Random Walks 2015 Ali Devin Sezer
+ PDF Chat Approximation of excessive backlog probabilities of two tandem queues 2018 Ali Devin Sezer
+ PDF Chat Fast Jackson networks 1999 James B. Martin
Yu. M. Suhov
+ Exit Probabilities and Balayage of Constrained Random Walks 2015 Ali Devin Sezer
+ Large Deviations of Generalised Jackson Networks 2008 Silke Meiner
+ Non-ergodic Jackson Networks with Infinite Supply - Local Stabilization and Local Equilibrium Analysis 2014 Jennifer Sommer
Hans Daduna
Bernd Heidergott
Vu
+ Etude asymptotique de grands reseaux stochastiques fermes 1994 Andrei Yakovlev
+ PDF Chat Brownian models of open queueing networks with homogeneous customer populations<sup>∗</sup> 1987 J. Michael Harrison
Ruth Williams
+ A note on the benefits of buffering 2004 Michel Mandjes
+ Many Server Queueing Models with Heterogeneous Servers and Parameter Uncertainty with Customer Contact Centre Applications 2018 Wenyi Qin
+ Evenements rares dans les réseaux 2005 Marc Lelarge
+ Nonergodic Jackson networks with infinite supply–local stabilization and local equilibrium analysis 2016 Jennifer Sommer
Hans Daduna
Bernd Heidergott
+ PDF Chat Stable matchings in high dimensions via the Poisson-weighted infinite tree 2020 Alexander E. Holroyd
James B. Martin
Yuval Peres
+ Tightness of stationary distributions of a flexible-server system in the Halfin-Whitt asymptotic regime 2014 Alexander Stolyar
+ Excessive Backlog Probabilities of Two Parallel Queues 2018 Kamil Demirberk Ünlü
Ali Devin Sezer
+ Asymptotic relations in queueing theory 1973 J. W. Cohen
+ Asymptotic analysis of closed queueing networks with bottlenecks 1992 Yaakov Kogan
Alexander Birman