Analysis of loss networks with routing

11Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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. © Institute of Mathematical Statistics, 2006.

Cite

CITATION STYLE

APA

Antunes, N., Fricker, C., Robert, P., & Tibi, D. (2006). Analysis of loss networks with routing. Annals of Applied Probability, 16(4), 2007–2026. https://doi.org/10.1214/105051606000000466

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free