diff options
author | Gerrit Renker <gerrit@erg.abdn.ac.uk> | 2006-12-03 11:53:07 -0500 |
---|---|---|
committer | Arnaldo Carvalho de Melo <acme@mandriva.com> | 2006-12-03 11:53:07 -0500 |
commit | 44158306d756c88272c8faf243ca68897498e219 (patch) | |
tree | b5406da158950a099336a67c507a0dd55c04fa25 /net/dccp/ccids/ccid3.c | |
parent | 006042d7e1a0aae35c9dd9eb8ec71fa379679adb (diff) |
[DCCP] ccid3: Deprecate TFRC_SMALLEST_P
This patch deprecates the existing use of an arbitrary value TFRC_SMALLEST_P
for low-threshold values of p. This avoids masking low-resolution errors.
Instead, the code now checks against real boundaries (implemented by preceding
patch) and provides warnings whenever a real value falls below the threshold.
If such messages are observed, it is a better solution to take this as an
indication that the lookup table needs to be re-engineered.
Changelog:
----------
This patch
* makes handling all TFRC resolution errors local to the TFRC library
* removes unnecessary test whether X_calc is 'infinity' due to p==0 -- this
condition is already caught by tfrc_calc_x()
* removes setting ccid3hctx_p = TFRC_SMALLEST_P in ccid3_hc_tx_packet_recv
since this is now done by the TFRC library
* updates BUG_ON test in ccid3_hc_tx_no_feedback_timer to take into account
that p now is either 0 (and then X_calc is irrelevant), or it is > 0; since
the handling of TFRC_SMALLEST_P is now taken care of in the tfrc library
Justification:
--------------
The TFRC code uses a lookup table which has a bounded resolution.
The lowest possible value of the loss event rate `p' which can be
resolved is currently 0.0001. Substituting this lower threshold for
p when p is less than 0.0001 results in a huge, exponentially-growing
error. The error can be computed by the following formula:
(f(0.0001) - f(p))/f(p) * 100 for p < 0.0001
Currently the solution is to use an (arbitrary) value
TFRC_SMALLEST_P = 40 * 1E-6 = 0.00004
and to consider all values below this value as `virtually zero'. Due to
the exponentially growing resolution error, this is not a good idea, since
it hides the fact that the table can not resolve practically occurring cases.
Already at p == TFRC_SMALLEST_P, the error is as high as 58.19%!
Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
Acked-by: Ian McDonald <ian.mcdonald@jandi.co.nz>
Signed-off-by: Arnaldo Carvalho de Melo <acme@mandriva.com>
Diffstat (limited to 'net/dccp/ccids/ccid3.c')
-rw-r--r-- | net/dccp/ccids/ccid3.c | 22 |
1 files changed, 6 insertions, 16 deletions
diff --git a/net/dccp/ccids/ccid3.c b/net/dccp/ccids/ccid3.c index 721efc7ed319..cf8c07b2704f 100644 --- a/net/dccp/ccids/ccid3.c +++ b/net/dccp/ccids/ccid3.c | |||
@@ -137,8 +137,7 @@ static void ccid3_hc_tx_update_x(struct sock *sk, struct timeval *now) | |||
137 | struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk); | 137 | struct ccid3_hc_tx_sock *hctx = ccid3_hc_tx_sk(sk); |
138 | const __u32 old_x = hctx->ccid3hctx_x; | 138 | const __u32 old_x = hctx->ccid3hctx_x; |
139 | 139 | ||
140 | /* To avoid large error in calcX */ | 140 | if (hctx->ccid3hctx_p > 0) { |
141 | if (hctx->ccid3hctx_p >= TFRC_SMALLEST_P) { | ||
142 | hctx->ccid3hctx_x_calc = tfrc_calc_x(hctx->ccid3hctx_s, | 141 | hctx->ccid3hctx_x_calc = tfrc_calc_x(hctx->ccid3hctx_s, |
143 | hctx->ccid3hctx_rtt, | 142 | hctx->ccid3hctx_rtt, |
144 | hctx->ccid3hctx_p); | 143 | hctx->ccid3hctx_p); |
@@ -226,16 +225,14 @@ static void ccid3_hc_tx_no_feedback_timer(unsigned long data) | |||
226 | ccid3_tx_state_name(hctx->ccid3hctx_state)); | 225 | ccid3_tx_state_name(hctx->ccid3hctx_state)); |
227 | /* Halve sending rate */ | 226 | /* Halve sending rate */ |
228 | 227 | ||
229 | /* If (X_calc > 2 * X_recv) | 228 | /* If (p == 0 || X_calc > 2 * X_recv) |
230 | * X_recv = max(X_recv / 2, s / (2 * t_mbi)); | 229 | * X_recv = max(X_recv / 2, s / (2 * t_mbi)); |
231 | * Else | 230 | * Else |
232 | * X_recv = X_calc / 4; | 231 | * X_recv = X_calc / 4; |
233 | */ | 232 | */ |
234 | BUG_ON(hctx->ccid3hctx_p >= TFRC_SMALLEST_P && | 233 | BUG_ON(hctx->ccid3hctx_p && !hctx->ccid3hctx_x_calc); |
235 | hctx->ccid3hctx_x_calc == 0); | ||
236 | 234 | ||
237 | /* check also if p is zero -> x_calc is infinity? */ | 235 | if (hctx->ccid3hctx_p == 0 || |
238 | if (hctx->ccid3hctx_p < TFRC_SMALLEST_P || | ||
239 | hctx->ccid3hctx_x_calc > 2 * hctx->ccid3hctx_x_recv) | 236 | hctx->ccid3hctx_x_calc > 2 * hctx->ccid3hctx_x_recv) |
240 | hctx->ccid3hctx_x_recv = max_t(u32, hctx->ccid3hctx_x_recv / 2, | 237 | hctx->ccid3hctx_x_recv = max_t(u32, hctx->ccid3hctx_x_recv / 2, |
241 | hctx->ccid3hctx_s / (2 * TFRC_T_MBI)); | 238 | hctx->ccid3hctx_s / (2 * TFRC_T_MBI)); |
@@ -449,15 +446,8 @@ static void ccid3_hc_tx_packet_recv(struct sock *sk, struct sk_buff *skb) | |||
449 | pinv = opt_recv->ccid3or_loss_event_rate; | 446 | pinv = opt_recv->ccid3or_loss_event_rate; |
450 | if (pinv == ~0U || pinv == 0) | 447 | if (pinv == ~0U || pinv == 0) |
451 | hctx->ccid3hctx_p = 0; | 448 | hctx->ccid3hctx_p = 0; |
452 | else { | 449 | else |
453 | hctx->ccid3hctx_p = 1000000 / pinv; | 450 | hctx->ccid3hctx_p = 1000000 / pinv; |
454 | |||
455 | if (hctx->ccid3hctx_p < TFRC_SMALLEST_P) { | ||
456 | hctx->ccid3hctx_p = TFRC_SMALLEST_P; | ||
457 | ccid3_pr_debug("%s, sk=%p, Smallest p used!\n", | ||
458 | dccp_role(sk), sk); | ||
459 | } | ||
460 | } | ||
461 | 451 | ||
462 | dccp_timestamp(sk, &now); | 452 | dccp_timestamp(sk, &now); |
463 | 453 | ||