A note on insensitivity in stochastic networks

Journal of Applied Probability (Impact Factor: 0.55). 12/2006; DOI:10.1239/jap/1175267175
Source: arXiv

ABSTRACT We give a simple and direct treatment of insensitivity in stochastic networks which is quite general and which provides probabilistic insight into the phenomenon. In the case of multi-class networks, the results generalise those of Bonald and Proutiere (2002, 2003).

0 0
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: We address a conjecture introduced by Massouli\'e (2007), concerning the large deviations of the stationary measure of bandwidth-sharing networks functioning under the Proportional fair allocation. For Markovian networks, we prove that Proportional fair and an associated reversible allocation are geometrically ergodic and have the same large deviations characteristics using Lyapunov functions and martingale arguments. For monotone networks, we give a more direct proof of the same result relying on stochastic comparisons that hold for general service requirement distribution. These results comfort the intuition that Proportional fairness is 'close' to allocations of service being insensitive to the service time requirement.
  • [show abstract] [hide abstract]
    ABSTRACT: This chapter reviews the theory of loss networks, in which calls of various types are accepted for service provided that this can commence immediately; otherwise they are rejected. An accepted call remains in the network for some holding time, which is generally independent of the state of the network, and throughout this time requires capacity simultaneously from various network resources. Both equilibrium and dynamical behaviour are studied; for the former a new approach is taken to the theory of uncontrolled loss networks, while the latter is the key to the understanding of stability issues in such networks.
    11/2010: pages 701-728;
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Polynomial convergence rates in total variation are established in Erlang--Sevastyanov's type problem with an infinite number of servers and a general distribution of service under assumptions on the intensity of serving.


Available from

Stan Zachary