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

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