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.