Analysis of loss networks with routing

Simple item page
dc.creatorAntunes, Nelson
dc.creatorFricker, Christine
dc.creatorRobert, Philippe
dc.creatorTibi, Danielle
dc.date2005-12-22
dc.date2007-02-14
dc.date.accessioned2026-07-07T08:23:12Z
dc.date.available2026-07-07T08:23:12Z
dc.descriptionThis 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.
dc.descriptionPublished at http://dx.doi.org/10.1214/105051606000000466 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
dc.identifierhttps://arxiv.org/abs/cs/0512088
dc.identifierhttp://arxiv.org/abs/cs/0512088
dc.identifierAnnals of Applied Probability 16, 4 (2006) 2007-2026
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135913
dc.subjectNetworking and Internet Architecture
dc.subjectProbability
dc.subject60K35 (Primary) 60K25 (Secondary)
dc.titleAnalysis of loss networks with routing
dc.typetext

Files

Collections

arXiv