|
|
| Riga 34: |
Riga 34: |
| | * Goodput-RTT plots for [[Tcp_over_Hsdpa:goodput_rtt_downlink|downlink]] and [[Tcp_over_Hsdpa:goodput_rtt_uplink|uplink]] channels. | | * Goodput-RTT plots for [[Tcp_over_Hsdpa:goodput_rtt_downlink|downlink]] and [[Tcp_over_Hsdpa:goodput_rtt_uplink|uplink]] channels. |
| | * Timeouts and packet loss ratio bar graphs for [[Tcp_over_Hsdpa:plrto_downlink|downlink]] and [[Tcp_over_Hsdpa:plrto_rtt_downlink|uplink]] channels (3 times timeouts and 2 times packet loss ratio of BIC/CUBIC wrt NewReno/Westwood+) | | * Timeouts and packet loss ratio bar graphs for [[Tcp_over_Hsdpa:plrto_downlink|downlink]] and [[Tcp_over_Hsdpa:plrto_rtt_downlink|uplink]] channels (3 times timeouts and 2 times packet loss ratio of BIC/CUBIC wrt NewReno/Westwood+) |
| | + | |
| | + | ==Congestion window and RTT evolutions== |
| | + | [[Immagine:hsdpa_cwnd_1_flow_downlink_westwood.png|500px|]] |
| | + | [[Immagine:hsdpa_cwnd_1_flow_downlink_newreno.png|500px|]] |
| | + | [[Immagine:hsdpa_cwnd_1_flow_downlink_bic.png|500px|]] |
| | + | [[Immagine:hsdpa_cwnd_1_flow_downlink_cubic.png|500px|]] |
Revisione 17:53, 2 Dic 2008
TCP Congestion Control Algorithms over a live HSDPA Network
We report results obtained by an extensive measurement campaign over a live HSDPA network involving more than 3000 flows resulting in around 60 hours of active measurements. The considered TCP variants are the following:
- TCP NewReno: the only congestion control algorithm standardized by IETF
- TCP BIC: the default congestion control algorithm adopted by the Linux o.s.
- TCP Cubic: a congestion control algorithm designed for fast convergence employing a cubic function in the probing phase
- TCP Westwood+: available in the Linux kernel (both 2.4 and 2.6 kernels).
The experimental evaluation has been carried out by accessing the public Internet using a commercial HSDPA card (see figure below).
The following instantaneous variable measurements have been collected by using the libnetmeas library:
- Goodput
- Round Trip Time (RTT)
- packet loss ratios
- number of timeouts
The main findings of the investigation can be summarized as follows:
- Differently from the case of the UMTS scenario, the considered TCP congestion control algorithms exhibited the following characteristics in the case of the downlink channel:
- TCP variants provides similar goodputs
- TCP Bic/Cubic exhibit inflated values for average RTT due to the aggressive nature of their probing phase. TCP NewReno and TCP Westwood+ provide lower values of RTT, TCP Westwood+ exhibiting the lowest.
- TCP Bic/Cubic provoke two times packet retransmission values with respect to TCP Westwood+ and TCP NewReno.
- TCP Bic/Cubic provoke roughly three times the number of timeouts wrt TCP Westwood+ and TCP NewReno, TCP Cubic exhibiting the highest number.
- In the case of the uplink channel the algorithms exhibited similar performances, due to the fact that the moderate size of cwnd forced TCP Cubic and TCP Bic to use the linear probing in order to be TCP friendly (see [1]).
We report cumulative distribution function plots:
- downlink and uplink channel goodput CDFs
- downlink and uplink RTT CDFs
- Goodput-RTT plots for downlink and uplink channels.
- Timeouts and packet loss ratio bar graphs for downlink and uplink channels (3 times timeouts and 2 times packet loss ratio of BIC/CUBIC wrt NewReno/Westwood+)
Congestion window and RTT evolutions
