Analysis of Loss Networks with Routing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Annals of Applied Probability Year : 2006

Analysis of Loss Networks with Routing


This paper analyzes stochastic networks consisting of finite capacity nodes with different classes of requests which move according to some routing policy. The Markov processes describing these networks do not have, in general, reversibility properties so that the explicit expression of their invariant distribution is not known. A heavy traffic limit regime is considered: the arrival rates of calls as well as the capacities of the nodes are proportional to a factor going to infinity. It is proved that, in the limit, the associated rescaled Markov process converges to a deterministic dynamical system with a unique equilibrium point characterized by a non-standard fixed point equation.
Fichier principal
Vignette du fichier
Full-Heavy.pdf (236.87 Ko) Télécharger le fichier

Dates and versions

inria-00000959 , version 1 (21-12-2005)
inria-00000959 , version 2 (13-01-2006)
inria-00000959 , version 3 (26-04-2006)



Nelson Antunes, Christine Fricker, Philippe Robert, Danielle Tibi. Analysis of Loss Networks with Routing. Annals of Applied Probability, 2006, 16 (4), pp.2007­-2026. ⟨inria-00000959v3⟩
198 View
441 Download



Gmail Facebook Twitter LinkedIn More