Please use this identifier to cite or link to this item:
|Title:||TCP Vegas-A: Solving the fairness and rerouting issues of TCP Vegas||Authors:||Srijith, K.N.
|Issue Date:||2003||Citation:||Srijith, K.N.,Jacob, L.,Ananda, A.L. (2003). TCP Vegas-A: Solving the fairness and rerouting issues of TCP Vegas. IEEE International Performance, Computing and Communications Conference, Proceedings : 309-316. ScholarBank@NUS Repository.||Abstract:||In spite of the larger performance gain such as higher throughput and almost zero packet retransmissions compared to TCP Reno, TCP Vegas still has a few obstacles for it to be deployed in the Internet. Studies have shown unfair treatment to Vegas connections when they compete with Reno connections. Other issues identified with TCP Vegas are problems of rerouting, persistent congestion, and discrepancy in flow rate tied with starting times and link bandwidth. We reinvestigate these issues and propose modifications to the congestion avoidance mechanism of the TCP Vegas, with the slow-start and congestion recovery algorithms of Vegas remaining untouched. Unlike the solutions proposed in the recent past to deal with some of these issues, our solution is neither dependent on any critical parameter values nor on the buffer management scheme at the routers (e.g. RED). Our experiments show that the modified TCP Vegas (Vegas-A) is able to obtain a fairer share of the network bandwidth when competing with other TCP flows. We also show that Vegas-A can tackle rerouting issues and rectify Vegas's bias against higher bandwidth flows. At the same time, our experiments prove that Vegas-A preserves the properties of Vegas that have made it a noteworthy protocol.||Source Title:||IEEE International Performance, Computing and Communications Conference, Proceedings||URI:||http://scholarbank.nus.edu.sg/handle/10635/40448|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.