Large Deviations Problems for Star Networks: the Min Policy Part I: Finite Time - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

Large Deviations Problems for Star Networks: the Min Policy Part I: Finite Time

Abstract

In this paper, we prove a sample path large deviation principle for a rescaled process $n^{-1}Q_{nt}$, where $Q_t$ represents the joint number of connections at time $t$ in a star network where the bandwidth is shared between customers according to the so-called min policy. The rate function is computed explicitly. One of the main steps consists in deriving large deviation bounds for an empirical generator constructed from the join number of customers and arrivals on each route. The rest of the analysis relies on a suitable change of measure together with a localization procedure.
Fichier principal
Vignette du fichier
RR-4143.pdf (561.2 Ko) Télécharger le fichier

Dates and versions

inria-00072481 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072481 , version 1

Cite

Franck Delcoigne, Arnaud de La Fortelle. Large Deviations Problems for Star Networks: the Min Policy Part I: Finite Time. [Research Report] RR-4143, INRIA. 2001. ⟨inria-00072481⟩
94 View
87 Download

Share

Gmail Facebook X LinkedIn More