Contact: Jean-Yves Le Boudec
It is known that flows with a long round trip time recive less throughput in networks employing the end-to-end control mechanism of additive increase and multiplicative decrease to adjust the window size. It is however not clear what can be attributed to the principle of additive increase and multiplicative decrease on one side, and to the fact that the control mechanism is window based instead of rate based. The first part of the job is to study the influence of the round trip time on the additive increase and multiplicative decrease control method. The starting point is an analysis of the Markov chain describing teh system by the so called “P-simulation” method. The second phase is to validate the results against TCP simulations realised with NS, the network simulator of the LBL.
Skills required: Markov chains; simulation; basic programming
Benefits: you will have done the experience of analysing the performance of a fundamental algorithm used in the Internet
Domain: Network performance analysis