Performance Evaluation 49 (2002) 43–56Īltman, E., Barakat, C., Laborde, E., Brown, P., Collange, D.: Fairness Analysis of TCP/IP. In: Proceedings of ITC-17, Salvador da Bahia (2001)Īltman, E., Jiménez, T., Núñez-Queija, R.: Analysis of Two Competing TCP/IP Connections. Vojnovic, M., Le-Boudec, J.Y.: Some Observations on Equation-Based Rate Control. (1991)īaccelli, F., Hong, D.: AIMD, Fairness and Fractal Scaling of TCP Traffic. Zhang, L., Shenker, S., Clark, D.: Observations on the Dynamics of a Congestion Control Algorithm: The Effects of Two-Way Traffic. IEEE/ACM Transactions on Networking (1997) Lakshman, T., Madhow, U.: The Performance of TCP/IP for Networks with High Bandwidth-Delay Products and Random Loss. In: Proceedings of ICCC’97, Cannes (1997) 469–477īrown, P.: Resource Sharing of TCP Connections with Different Round Trip Times. (1998) 303–314Īit-Hellal, O., Altman, E., Elouadghiri, D., Erramdani, M., Mikou, N.: Performance of TCP/IP: The Case of Two Controlled Sources. Padhye, J., Firoiu, V., Kurose, J., Towsley, D.: Modeling TCP Throughput: A Simple Model and its Empirical Validation. We show, in contrast, that the second moment of the throughput does depend on the strategy.

We show that, surprisingly, 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. 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. 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. 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. When congestion occurs, one (or both) connections will suffer a loss that will cause its throughput to decrease by a multiplicative factor. We study in this paper two competing TCP connections that share a common bottleneck link.

Tcp ip view