A TCP congestion avoidance algorithm for improved fairness in computer networks /
خوارزمية تجنب الاختناق فى بروتوكول الTCp لتحقيق توزيع عادل لموارد الشبكة
Aref Hassan Kurdali ; Supervised Amen Mohamed Nassar , Hany Mohamed Elsayed
- Cairo : Aref Hassan Kurdali , 2005
- 80P : charts ; 30cm
Thesis (M.Sc.) - Cairo University - Faculty Of Engineering - Department Of Computer Engineering
a lot of unresolved issues associated with original TCP Vegas TCP Vegas is known to achieve between better throughput , with one - half to one - fifth the losses , as compared to the implementation of TCP in the New Reno , which is widely used in the current Internet However , the above mentioned issues have prevented it from being widely accepted and deployed over the Inter Some of the issues that have been identified so far are the unfairness experienced by TCP Vegas flows while competing with TCP New Reno flows When connections of the two versions share a bottleneck link , it is observed that TCP Vegas suffers from serious performance degradation because of the difference of buffer occupancy at the routers This is because TCP Vegas has a conservative algorithm to decide when to vary the congestion window On the other hand , TCP New Reno , in an effort to fully utilize the bandwidth , continues to increase the window size until a packet loss is detected Thus , while TCP Vegas tries to maintain a smaller queue , TCP Reno keeps a larger number of packets in the buffer , and thus steals a larger share of available bandwidth