pith. sign in

arxiv: cs/0512088 · v4 · submitted 2005-12-22 · 💻 cs.NI · math.PR

Analysis of loss networks with routing

classification 💻 cs.NI math.PR
keywords networksmarkovnodespointroutingaccordinganalysisanalyzes
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.