Mathematics – Probability
Scientific paper
2010-10-15
Annals of Applied Probability 2010, Vol. 20, No. 3, 1126-1176
Mathematics
Probability
Published in at http://dx.doi.org/10.1214/09-AAP649 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Inst
Scientific paper
10.1214/09-AAP649
There has recently been considerable interest in the stability of different fair bandwidth sharing policies for models that arise in the context of Internet congestion control. Here, we consider a connection level model, introduced by Massouli\'{e} and Roberts [Telecommunication Systems 15 (2000) 185--201], that represents the randomly varying number of flows present in a network. The weighted $\alpha$-fair and weighted max-min fair bandwidth sharing policies are among important policies that have been studied for this model. Stability results are known in both cases when the interarrival times and service times are exponentially distributed. Partial results for general service times are known for weighted $\alpha$-fair policies; no such results are known for weighted max--min fair policies. Here, we show that weighted max--min fair policies are stable for subcritical networks with general interarrival and service distributions, provided the latter have $2+\delta_1$ moments for some $\delta_1>0$. Our argument employs an appropriate Lyapunov function for the weighted max--min fair policy.
No associations
LandOfFree
Network stability under max--min fair bandwidth sharing 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 Network stability under max--min fair bandwidth sharing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network stability under max--min fair bandwidth sharing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-203981