By Topic

On hop-by-hop rate-based congestion control

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

3 Author(s)
Mishra, P.P. ; AT&T Bell Labs., Murray Hill, NJ, USA ; Kanakia, H. ; Tripathi, S.K.

The activity in building gigabit speed networks has led many researchers to re-examine the issue of congestion control. We describe a rate-based hop-by-hop congestion control mechanism in which the service rates of connections are dynamically adjusted at a switch, using feedback information provided by the neighboring switches. The desired service rate is computed based on a control equation that utilizes a model of the system with feedback information used to correct inaccuracies in the model. We use an analytical model to prove that the expected value of the queue occupancy and throughput of a controlled connection converge to the desired operating point. We also study the variation of the queue occupancy and throughput in steady-state as well as the transient response. The analytical results provide insights into how the parameter values chosen affect performance. We use simulations to compare the performance of the scheme with an equivalent end-to-end control scheme. Our analytical and simulation results show that the hop-by-hop scheme reacts faster to changes in the traffic intensity and, consequently, utilizes resources at the bottleneck better and loses fewer packets than the end-to-end scheme

Published in:

Networking, IEEE/ACM Transactions on  (Volume:4 ,  Issue: 2 )