The current paper presents a collection of experimentaldata portraying the performance achieved in the wirelesssetting by several TCP-friendly congestion controls recentlyproposed in literature. Thiswork is partly motivated bythe consideration that the majority of the analytical results inthis area are validated by simulation, rather than by field tests.Examining these algorithms in real environments can helpverify their actual effectiveness over the wireless Internet.To reach such goal, two representative controls among theso-called window-based TCP-friendly schemes have beenimplemented, namely, the General Additive Increase MultiplicativeDecrease (GAIMD) strategy, and the SQuare RooT(SQRT) binomial control; the most representative algorithmamong rate-based controls, the TCP Friendly Rate Control(TFRC), has also been considered. Their TCP-fairnessand smoothness have been comprehensively evaluated in anIEEE 802.11g Wireless Local Area Network (WLAN). Theobtained results show that the GAIMD and SQRT strategiesreveal non-negligible scalability and smoothness problems,that markedly limit their performance. It is empiricallydemonstrated that their “optimal” increase/decrease rules,based on TCP-Reno analytical model, cannot guarantee anadequate performance when GAIMD and SQRT competewith TCP-Sack, a de facto standard for current TCP implementations.TFRC is demonstrated to occasionally behave bewildering: properly tuning one of its congestion controlparameters and enhancing the algorithm with a flow-controlmechanism result in a definitely fairer share of bandwidthwith concurrent TCP flows.
Effectiveness and issues of congestion control in 802.11g wireless LANs / Borri, M; Casoni, Maurizio; Merani, Maria Luisa. - In: WIRELESS NETWORKS. - ISSN 1022-0038. - STAMPA. - 14:2(2008), pp. 171-182. [10.1007/s11276-006-8917-8]
Effectiveness and issues of congestion control in 802.11g wireless LANs
CASONI, Maurizio;MERANI, Maria Luisa
2008
Abstract
The current paper presents a collection of experimentaldata portraying the performance achieved in the wirelesssetting by several TCP-friendly congestion controls recentlyproposed in literature. Thiswork is partly motivated bythe consideration that the majority of the analytical results inthis area are validated by simulation, rather than by field tests.Examining these algorithms in real environments can helpverify their actual effectiveness over the wireless Internet.To reach such goal, two representative controls among theso-called window-based TCP-friendly schemes have beenimplemented, namely, the General Additive Increase MultiplicativeDecrease (GAIMD) strategy, and the SQuare RooT(SQRT) binomial control; the most representative algorithmamong rate-based controls, the TCP Friendly Rate Control(TFRC), has also been considered. Their TCP-fairnessand smoothness have been comprehensively evaluated in anIEEE 802.11g Wireless Local Area Network (WLAN). Theobtained results show that the GAIMD and SQRT strategiesreveal non-negligible scalability and smoothness problems,that markedly limit their performance. It is empiricallydemonstrated that their “optimal” increase/decrease rules,based on TCP-Reno analytical model, cannot guarantee anadequate performance when GAIMD and SQRT competewith TCP-Sack, a de facto standard for current TCP implementations.TFRC is demonstrated to occasionally behave bewildering: properly tuning one of its congestion controlparameters and enhancing the algorithm with a flow-controlmechanism result in a definitely fairer share of bandwidthwith concurrent TCP flows.File | Dimensione | Formato | |
---|---|---|---|
Original_WLESSNETS.pdf
Accesso riservato
Tipologia:
Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione
473.86 kB
Formato
Adobe PDF
|
473.86 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris