# 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.
Keywords :
Type de document :
Rapport
Domaine :
Liste complète des métadonnées

https://hal.inria.fr/inria-00072481
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 10:05:00
Dernière modification le : vendredi 25 mai 2018 - 12:02:05
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:09:48

### Identifiants

• HAL Id : inria-00072481, version 1

### Citation

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⟩

### Métriques

Consultations de la notice

## 220

Téléchargements de fichiers