From: Yuhan Cai (yuhancai@cs.washington.edu)
Date: Sun Oct 17 2004 - 20:05:30 PDT
Title: A Binary Feedback Scheme for Congestion Avoidance in Computer Networks with a Connectionless Network Layer
Author: K. K. Ramakrishnan and Raj Jain
Reviewed by: Yuhan Cai
Main results of the paper:
， It introduces a novel mechanism for congestion avoidance using connectionless network protocols.
， The scheme is designed for the overall "social" network congestion problems, with the goal to "avoid" congestion instead of "controlling" it, and minimizes the transmission overhead.
Strengths of the paper:
， The scheme minimizes the amount of feedback information in each packet so that no additional packets are needed and more transmission efforts can be saved.
， It's claimed to converge to the optimal operating point.
， It also addresses the issue of fairness, which most other frameworks ignored.
， Other advantages include its easy implementability, adaptability and stability in overloaded scenarios.
Key limitations:
， The theories are nice and address many possible issues, but the paper can not really convince people that the scheme is in fact superior to other existing approaches, in terms of any performance metrics (such as throughput and packet loss rate). It would be better if detailed experimental comparisons were presented.
Relevance of the paper:
， As the pioneer work in congestion avoidance, this paper has provided fellow researchers the fundamental framework to decrease the probability of the occurrence of congestions.
Future work:
， As the scheme uses only one extra bit to deal with congestion, it might be of further interest to explore whether it would be possible to use more bits to deliver even better performance.
This archive was generated by hypermail 2.1.6 : Sun Oct 17 2004 - 20:05:35 PDT