Skip to Main content Skip to Navigation

Loss Strategies for Competing TCP/IP Connections

Eitan Altman 1 Rachid El-Azouzi 2, 1 David Ros 3 Bruno Tuffin 3
1 MAESTRO - Models for the performance analysis and the control of networks
CRISAM - Inria Sophia Antipolis - Méditerranée
3 ARMOR - Architectures and network models
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes, Ecole Nationale Supérieure des Télécommunications de Bretagne
Abstract : We study in this paper two competing TCP connections that share a common bottleneck link. When congestion occurs, one (or both) connections will suffer a loss that will cause its throughput to decrease by a multiplicative factor. The identity of the connection that will suffer a loss is determined by a randomized «loss strategy» that may depend on the throughputs of the connections at the congestion instant. We analyze several loss strategies: the one in which the identity of loss is independent of the current throughput and the one in which the connection 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 connection 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 link. As the intuition says, a strategy that assigns a loss to a connection with a higher throughput is expected to give worse performance since the total instantaneous throughput after a loss is expected to be lower with such a strategy. Surprisingly, we show that this is not the case. We show that the average throughput and average link utilizations are invariant: they are the same under any possible strategy; the link utilization is 6/7 of the link capacity. We show, in contrast, that the second moment of the throughput does depend on the strategy.
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 5:43:02 PM
Last modification on : Thursday, February 11, 2021 - 2:48:03 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:18:18 PM


  • HAL Id : inria-00071483, version 1


Eitan Altman, Rachid El-Azouzi, David Ros, Bruno Tuffin. Loss Strategies for Competing TCP/IP Connections. [Research Report] RR-5100, INRIA. 2004. ⟨inria-00071483⟩



Record views


Files downloads