Analysis of Loss Networks with Routing

Abstract : 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.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00000959
Contributor : Philippe Robert <>
Submitted on : Wednesday, April 26, 2006 - 6:56:48 PM
Last modification on : Sunday, August 25, 2019 - 10:44:01 AM
Long-term archiving on : Thursday, September 23, 2010 - 4:09:13 PM

Identifiers

Citation

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

Share

Metrics

Record views

499

Files downloads

968