The Annals of Applied Probability
- Ann. Appl. Probab.
- Volume 14, Number 2 (2004), 1006-1028.
Large deviations problems for star networks: The min policy
We are interested in analyzing the effect of bandwidth sharing for telecommunication networks. More precisely, we want to calculate which routes are bottlenecks by means of large deviations techniques. The method is illustrated in this paper on a star network, where the bandwidth is shared between customers according to the so-called min policy. We prove a sample path large deviation principle for a rescaled process n−1Qnt, where Qt represents the joint number of connections at time t. The main result is to compute the rate function explicitly. The major step 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. An example shows how this can be used practically.
Ann. Appl. Probab., Volume 14, Number 2 (2004), 1006-1028.
First available in Project Euclid: 23 April 2004
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 60F10: Large deviations
Secondary: 60K30: Applications (congestion, allocation, storage, traffic, etc.) [See also 90Bxx]
Delcoigne, Franck; de La Fortelle, Arnaud. Large deviations problems for star networks: The min policy. Ann. Appl. Probab. 14 (2004), no. 2, 1006--1028. doi:10.1214/105051604000000198. https://projecteuclid.org/euclid.aoap/1082737120