By Topic

Performance analysis of rate-based congestion control algorithm for receiver-directed packet-radio networks

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)
Escobar, J. ; Bolt Beranek & Newman Inc., Cambridge, MA, USA ; Lauer, G. ; Steenstrup, M.

The performance of a congestion control algorithm developed for DARPA's Survivable Adaptive Networking (SURAN) packet radio network is discussed, focusing on throughput-delay characteristics, max-min fairness, speed of response, and algorithm robustness. It is shown, through analysis and simulation, that the algorithm effectively regulates source flows without severely limiting network throughput and achieves max-min fairness in a large class of situations. The algorithm can achieve max-min fair flow allocation in a large class of situations. A class of situations where fairness is not achieved, due to channel access interactions, is also discussed

Published in:

Military Communications Conference, 1990. MILCOM '90, Conference Record, A New Era. 1990 IEEE

Date of Conference:

30 Sep-3 Oct 1990