This paper has focused on two rate-based congestion control algorithms, namely TCP-friendly rate control (TFRC) and the adaptive rate control (ARC), for streaming flows over the Internet. After a brief description of the two algorithms, computer simulations using ns-2 have been reported to investigate intra-protocol fairness, inter-protocol friendliness and efficiency. The main results are given: (1) ARC is friendly towards Reno TCP whereas TFRC is not; (2) ARC increases fairness; (3) ARC remarkably improves the goodput with respect to TFRC and Reno TCP in the presence of wireless lossy links.
Efficiency, Fairness and Friendliness Evaluation of TFRC and ARC Rate-Based Congestion Control / Grieco, L. A.; Mascolo, S.. - STAMPA. - (2004), pp. 353-356. (Intervento presentato al convegno IEEE 1st International Symposium on Control, Communications and Signal Processing, ISCCSP 2004 tenutosi a Hammamet, Tunisia nel March 21-24, 2004) [10.1109/ISCCSP.2004.1296301].
Efficiency, Fairness and Friendliness Evaluation of TFRC and ARC Rate-Based Congestion Control
L. A. Grieco;S. Mascolo
2004-01-01
Abstract
This paper has focused on two rate-based congestion control algorithms, namely TCP-friendly rate control (TFRC) and the adaptive rate control (ARC), for streaming flows over the Internet. After a brief description of the two algorithms, computer simulations using ns-2 have been reported to investigate intra-protocol fairness, inter-protocol friendliness and efficiency. The main results are given: (1) ARC is friendly towards Reno TCP whereas TFRC is not; (2) ARC increases fairness; (3) ARC remarkably improves the goodput with respect to TFRC and Reno TCP in the presence of wireless lossy links.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
