Congestion control algorithms of TCP in emerging networks

dc.contributorReddy, A. L. Narasimha
dc.creatorBhandarkar, Sumitha
dc.date.accessioned2010-01-15T00:15:31Z
dc.date.accessioned2010-01-16T02:08:04Z
dc.date.accessioned2017-04-07T19:56:42Z
dc.date.available2010-01-15T00:15:31Z
dc.date.available2010-01-16T02:08:04Z
dc.date.available2017-04-07T19:56:42Z
dc.date.created2006-08
dc.date.issued2009-06-02
dc.description.abstractIn this dissertation we examine some of the challenges faced by the congestion control algorithms of TCP in emerging networks. We focus on three main issues. First, we propose TCP with delayed congestion response (TCP-DCR), for improving performance in the presence of non-congestion events. TCP-DCR delays the conges- tion response for a short interval of time, allowing local recovery mechanisms to handle the event, if possible. If at the end of the delay, the event persists, it is treated as congestion loss. We evaluate TCP-DCR through analysis and simulations. Results show significant performance improvements in the presence of non-congestion events with marginal impact in their absence. TCP-DCR maintains fairness with standard TCP variants that respond immediately. Second, we propose Layered TCP (LTCP), which modifies a TCP flow to behave as a collection of virtual flows (or layers), to improve eficiency in high-speed networks. The number of layers is determined by dynamic network conditions. Convergence properties and RTT-unfairness are maintained similar to that of TCP. We provide the intuition and the design for the LTCP protocol and evaluation results based on both simulations and Linux implementation. Results show that LTCP is about an order of magnitude faster than TCP in utilizing high bandwidth links while maintaining promising convergence properties. Third, we study the feasibility of employing congestion avoidance algorithms in TCP. We show that end-host based congestion prediction is more accurate than previously characterized. However, uncertainties in congestion prediction may be un- avoidable. To address these uncertainties, we propose an end-host based mechanism called Probabilistic Early Response TCP (PERT). PERT emulates the probabilistic response function of the router-based scheme RED/ECN in the congestion response function of the end-host. We show through extensive simulations that, similar to router-based RED/ECN, PERT provides fair bandwidth sharing with low queuing delays and negligible packet losses, without requiring the router support. It exhibits better characteristics than TCP-Vegas, the illustrative end-host scheme. PERT can also be used for emulating other router schemes. We illustrate this through prelim- inary results for emulating the router-based mechanism REM/ECN. Finally, we show the interactions and benefits of combining the different proposed mechanisms.
dc.identifier.urihttp://hdl.handle.net/1969.1/ETD-TAMU-1757
dc.language.isoen_US
dc.subjectTCP
dc.subjectCongestion Control
dc.subjectReordering
dc.subjectHighspeed netowrks
dc.subjectAQM
dc.titleCongestion control algorithms of TCP in emerging networks
dc.typeBook
dc.typeThesis

Files