From: Yuhan Cai (yuhancai@cs.washington.edu)
Date: Sun Oct 24 2004 - 20:06:16 PDT
Title: Analysis and Simulation of a Fair Queuing Algorithm
Author: Alan Demers, Srinivasan Keshav and Scott Shenker
Reviewed by: Yuhan Cai
Main results of the paper:
， A new fair queuing algorithm that can function well even with ill-behaved sources is presented.
， Several combinations of queuing algorithms and flow control on six benchmark networks are analyzed and compared.
Strengths of the paper:
， Although queuing algorithms do not affect congestions directly, they play an important role in the interactions among packets from different sources. While this is often light-weighted in existing work, it is claimed to be a crucial component in congestion control in this paper.
， Compared with the first-come-first-served (FCFS) algorithm, the new one enjoys a fair bandwidth allocation, a low delay for sources and a protection from ill-behaved sources.
， The theories are well-supported by a performance evaluation in the context of static routing and several widely used flow control algorithms.
Key limitations:
， Neither fairness nor promptness is rigorously defined in this paper.
Relevance of the paper:
， A detailed analysis of the design requirements for effective queuing is outlined in this paper and then a new queuing algorithm is presented to meet these requirements.
Future work:
， Whether it is possible to build economically feasible gateways that can match the bandwidth of fibers is worth exploring.
This archive was generated by hypermail 2.1.6 : Sun Oct 24 2004 - 20:06:21 PDT