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.
Document type :
Other publications
Complete list of metadatas

https://hal.inria.fr/inria-00000959
Contributor : Philippe Robert <>
Submitted on : Wednesday, December 21, 2005 - 8:27:21 AM
Last modification on : Friday, January 4, 2019 - 5:32:33 PM
Long-term archiving on : Saturday, April 3, 2010 - 7:43:46 PM

Identifiers

Citation

Nelson Antunes, Christine Fricker, Philippe Robert, Danielle Tibi. Analysis of Loss Networks with Routing. 2005. ⟨inria-00000959v1⟩

Share

Metrics

Record views

6

Files downloads

51