By Topic

On the proportional fairness of TCP Vegas

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Luong, D.D. ; Dept. of Telecommun. & Telematics, Budapest Univ. of Technol. & Econ., Hungary ; Biro, J.

This paper concerns the fairness of TCP Vegas, a new version of TCP proposed by Brakmo et al., (1994). Firstly, we show some uncertainties in bandwidth allocation and buffer occupancy when the system is in the stable state. These uncertainties come from the using of two threshold values (α, β) in the applied innovative congestion avoidance mechanism. We propose a modification in the existing implementations of TCP Vegas to reduce the uncertainties without losing the stability. Secondly, the notion of the ideal TCP Vegas, which has no uncertainties, is defined. We prove that the ideal TCP Vegas is exactly proportionally fair in bandwidth sharing. This property of the real TCP Vegas is tested by simulation. We also show how to implement weighted proportional fairness with TCP Vegas

Published in:

Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE  (Volume:3 )

Date of Conference:

2001