Efficient Congestion Avoidance Mechanism - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2000

Efficient Congestion Avoidance Mechanism

Anca Dracinschi
  • Fonction : Auteur
  • PersonId : 1014260
Serge Fdida

Résumé

Increasing uncontrolled best-effort traffic deteriorates the ability of TCP to control congestion and is a source of high drop rates. This paper proposes an efficient congestion avoidance mechanism (ECAM) suitable for uncontrolled unicast and multicast best-effort flows. ECAM relies on and enhances a previous congestion avoidance mechanism for non-reliable flows that we have proposed previously. The key reason to the generality of our mechanism is the decoupling of congestion control from reliability through the use of source quench-like congestion feedback to the senders. As one of the main causes for high packet loss rates in the Internet is the lack of early notification of network congestion, we use active queue management techniques that have been developed to cope with this problem. Hence, we originally adapt random early detection (RED) and early congestion notification (ECN) for UDP in order to allow the UDP flows to be adaptive to network dynamics. We demonstrate through simulation that ECAM significantly reduces packet loss, enhance UDP to fairly coexist with TCP flows and provides an efficient and simple solution to congestion avoidance.
Fichier non déposé

Dates et versions

hal-01573145 , version 1 (08-08-2017)

Identifiants

Citer

Anca Dracinschi, Serge Fdida. Efficient Congestion Avoidance Mechanism. LCN 2000 - 25th IEEE Conference on Local Computer Networks, Nov 2000, Tampa, FL, United States. pp.228-237, ⟨10.1109/LCN.2000.891034⟩. ⟨hal-01573145⟩
43 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More