Approximate theoretical models for TCP connections using different high speed congestion control algorithms in a multihop network

We consider a multihop network when the flows may be using TCP Reno, CUBIC or Compound. We study its performance using fluid approximations. We provide theoretical justification for these approximations. Our approximations are simple, yet can be used to obtain throughput and average window size for each TCP connection with good accuracy. We compare results obtained using fluid approximations with discrete Markov chain models in [1] and [2] and with ns2 simulations. The fluid approximation models can be seen to trade-off accuracy for simplicity.