21774 articles – 15587 references  [version française]

inria-00000959, version 2

Analysis of Loss Networks with Routing

Nelson Antunes () 1, Christine Fricker () 2, Philippe Robert () 2, Danielle Tibi 3

Annals of Applied Probability (2005)

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.

  • 1:  Faculdade de Ciências e Tecnologia (FCT)
  • Universidade do Algarve
  • 2:  RAP (INRIA Paris - Rocquencourt)
  • INRIA : PARIS - ROCQUENCOURT
  • 3:  Laboratoire de Probabilités et Modèles Aléatoires (LPMA)
  • CNRS : UMR7599 – Université Pierre et Marie Curie [UPMC] - Paris VI – Université Paris VII - Paris Diderot
  • Domain : Computer Science/Networking and Telecommunication
    Mathematics/Probability
  • Keywords : Stochastic Networks. Heavy Traffic Limits. Asymptotic Dynamical Systems. Fixed Point Equations.
  • Available versions :  v1 (2005-12-22) v2 (2006-01-13) v3 (2006-04-28)
 
  • inria-00000959, version 2
  • oai:hal.inria.fr:inria-00000959
  • From: 
  • Submitted on: Friday, 13 January 2006 08:03:54
  • Updated on: Wednesday, 26 April 2006 18:46:07