TCP shows poor performance in high speed networks with large latencies as well as in wireless networks where link error rates are high. The main two factors degrading TCP performance are related to its conservative policies for sending rate increase and treating all packet losses as congestion-related. In order to address these limitations a number of solutions have been proposed. Most of them either adapt to the large bandwidth-delay product when the loss rate is low (below 10-7) or face the problem of high error rate (above 10-3) not accounting for high-speed connections. In this paper we propose a novel approach Kikolo TCP. It is based on Markov Modulated Poisson Process (MMPP) to control the congestion window evolution. Kikolo TCP offers improved performance in environments with high error rates. At the same time it ensures bandwidth scalability in low loss environments, TCP friendliness and fairness. © 2010 IEEE.
TCP Kikolo for Performance Improvement in High-Speed Networks in Presence of Packet Losses
Granelli, Fabrizio;Kliazovich, Dzmitry
2010-01-01
Abstract
TCP shows poor performance in high speed networks with large latencies as well as in wireless networks where link error rates are high. The main two factors degrading TCP performance are related to its conservative policies for sending rate increase and treating all packet losses as congestion-related. In order to address these limitations a number of solutions have been proposed. Most of them either adapt to the large bandwidth-delay product when the loss rate is low (below 10-7) or face the problem of high error rate (above 10-3) not accounting for high-speed connections. In this paper we propose a novel approach Kikolo TCP. It is based on Markov Modulated Poisson Process (MMPP) to control the congestion window evolution. Kikolo TCP offers improved performance in environments with high error rates. At the same time it ensures bandwidth scalability in low loss environments, TCP friendliness and fairness. © 2010 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione



