Large deviations problems for star networks: the min policy

Details Large deviations problems for star networks: the min policy Large deviations problems for star networks: the min policy

2004-06-09

arxiv.org/abs/math/0406181v1

Annals of Probability 2004, Vol. 14, No. 2, 1006-1028

Mathematics

Probability

Scientific paper

10.1214/105051604000000198

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^{-1}Q_{nt}, where Q_t 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.

Affiliated with

Also associated with

No associations

Rating

Large deviations problems for star networks: the min policy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Large deviations problems for star networks: the min policy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large deviations problems for star networks: the min policy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376223