Sciweavers

CN
2006

Loss strategies for competing AIMD flows

13 years 4 months ago
Loss strategies for competing AIMD flows
We study in this paper two competing AIMD flows that share a common bottleneck link. When congestion occurs, one (or both) flows will suffer a loss that will cause its throughput to decrease by a multiplicative factor. The identity of the flow that will suffer a loss is determined by a randomized ``loss strategy'' that may depend on the throughputs of the flows at the congestion instant. We analyze several loss strategies: the one in which the identity of the flow experiencing the loss is independent of the current throughput and the one in which the flow with the largest throughput is to suffer the loss; this is compared with the strategy that assigns loss probabilities proportionally to the throughputs (thus a flow with a larger throughput has a larger loss probability). After deriving some results for the general asymmetric case, we focus in particular on the symmetric case and study the influence of the strategy on the average throughput and average utilization of the li...
Eitan Altman, Rachid El Azouzi, David Ros, Bruno T
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CN
Authors Eitan Altman, Rachid El Azouzi, David Ros, Bruno Tuffin
Comments (0)