Open Access
November 2006 Analysis of loss networks with routing
Nelson Antunes, Christine Fricker, Philippe Robert, Danielle Tibi
Ann. Appl. Probab. 16(4): 2007-2026 (November 2006). DOI: 10.1214/105051606000000466

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, in general, have reversibility properties, so the explicit expression of their invariant distribution is not known. Kelly’s limiting 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 limit, the associated rescaled Markov process converges to a deterministic dynamical system with a unique equilibrium point characterized by a nonstandard fixed point equation.

Citation

Download Citation

Nelson Antunes. Christine Fricker. Philippe Robert. Danielle Tibi. "Analysis of loss networks with routing." Ann. Appl. Probab. 16 (4) 2007 - 2026, November 2006. https://doi.org/10.1214/105051606000000466

Information

Published: November 2006
First available in Project Euclid: 17 January 2007

zbMATH: 1121.60100
MathSciNet: MR2288711
Digital Object Identifier: 10.1214/105051606000000466

Subjects:
Primary: 60K35
Secondary: 60K25

Keywords: asymptotic dynamical systems , fixed point equations , scaling , Stochastic networks

Rights: Copyright © 2006 Institute of Mathematical Statistics

Vol.16 • No. 4 • November 2006
Back to Top