TCP Vegas Congestion Control Algorithm. Mridul Sharma CS 590f Project Presentation. Contents. Motivation TCP Vegas Congestion Control Algorithm Slow Start Congestion Avoidance Fast Retransmit The Problem Simulations Conclusions. Motivation.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
CS 590f Project Presentation
Slow Start Congestion Avoidance
If Diff >
The TCP Reno Congestion avoidance scheme is aggressive in the sense that it leaves little room in the buffer for other connections, while TCP Vegas is conservative and tries to occupy little buffer space.
When a TCP Vegas connection shares a link with TCP Reno connection, the TCP Reno connection uses most of the buffer space and the TCP Vegas connection backs off, interpreting this as a sign of network congestion.
It is necessary to achieve fairness between Vegas and Reno connections for deployment of TCP Vegas into the operating network.
There are two approaches
Modify the TCP Vegas congestion Control Algorithm
Modify the router packet dropping schemes like RED to detect misbehaving flows (Reno in this case) and punish them more severely.