Arnaldo Carvalho de Melo | 7c65787 | 2005-08-09 20:14:34 -0700 | [diff] [blame] | 1 | menu "DCCP CCIDs Configuration (EXPERIMENTAL)" |
| 2 | depends on IP_DCCP && EXPERIMENTAL |
| 3 | |
Andrea Bittau | 2a91aa3 | 2006-03-20 17:41:47 -0800 | [diff] [blame^] | 4 | config IP_DCCP_CCID2 |
| 5 | tristate "CCID2 (TCP) (EXPERIMENTAL)" |
| 6 | depends on IP_DCCP |
| 7 | select IP_DCCP_ACKVEC |
| 8 | ---help--- |
| 9 | CCID 2, TCP-like Congestion Control, denotes Additive Increase, |
| 10 | Multiplicative Decrease (AIMD) congestion control with behavior |
| 11 | modelled directly on TCP, including congestion window, slow start, |
| 12 | timeouts, and so forth [RFC 2581]. CCID 2 achieves maximum |
| 13 | bandwidth over the long term, consistent with the use of end-to-end |
| 14 | congestion control, but halves its congestion window in response to |
| 15 | each congestion event. This leads to the abrupt rate changes |
| 16 | typical of TCP. Applications should use CCID 2 if they prefer |
| 17 | maximum bandwidth utilization to steadiness of rate. This is often |
| 18 | the case for applications that are not playing their data directly |
| 19 | to the user. For example, a hypothetical application that |
| 20 | transferred files over DCCP, using application-level retransmissions |
| 21 | for lost packets, would prefer CCID 2 to CCID 3. On-line games may |
| 22 | also prefer CCID 2. |
| 23 | |
| 24 | CCID 2 is further described in: |
| 25 | http://www.icir.org/kohler/dccp/draft-ietf-dccp-ccid2-10.txt |
| 26 | |
| 27 | This text was extracted from: |
| 28 | http://www.icir.org/kohler/dccp/draft-ietf-dccp-spec-13.txt |
| 29 | |
| 30 | If in doubt, say M. |
| 31 | |
Arnaldo Carvalho de Melo | 7c65787 | 2005-08-09 20:14:34 -0700 | [diff] [blame] | 32 | config IP_DCCP_CCID3 |
| 33 | tristate "CCID3 (TFRC) (EXPERIMENTAL)" |
| 34 | depends on IP_DCCP |
| 35 | ---help--- |
| 36 | CCID 3 denotes TCP-Friendly Rate Control (TFRC), an equation-based |
| 37 | rate-controlled congestion control mechanism. TFRC is designed to |
| 38 | be reasonably fair when competing for bandwidth with TCP-like flows, |
| 39 | where a flow is "reasonably fair" if its sending rate is generally |
| 40 | within a factor of two of the sending rate of a TCP flow under the |
| 41 | same conditions. However, TFRC has a much lower variation of |
| 42 | throughput over time compared with TCP, which makes CCID 3 more |
| 43 | suitable than CCID 2 for applications such streaming media where a |
| 44 | relatively smooth sending rate is of importance. |
| 45 | |
Andrea Bittau | 2a91aa3 | 2006-03-20 17:41:47 -0800 | [diff] [blame^] | 46 | CCID 3 is further described in: |
Arnaldo Carvalho de Melo | 7c65787 | 2005-08-09 20:14:34 -0700 | [diff] [blame] | 47 | |
Andrea Bittau | 2a91aa3 | 2006-03-20 17:41:47 -0800 | [diff] [blame^] | 48 | http://www.icir.org/kohler/dccp/draft-ietf-dccp-ccid3-11.txt. |
| 49 | |
| 50 | The TFRC congestion control algorithms were initially described in |
| 51 | RFC 3448. |
| 52 | |
| 53 | This text was extracted from: |
| 54 | http://www.icir.org/kohler/dccp/draft-ietf-dccp-spec-13.txt |
Arnaldo Carvalho de Melo | 7c65787 | 2005-08-09 20:14:34 -0700 | [diff] [blame] | 55 | |
| 56 | If in doubt, say M. |
| 57 | |
Arnaldo Carvalho de Melo | 5cea0dd | 2005-08-27 23:50:46 -0300 | [diff] [blame] | 58 | config IP_DCCP_TFRC_LIB |
| 59 | depends on IP_DCCP_CCID3 |
| 60 | def_tristate IP_DCCP_CCID3 |
| 61 | |
Arnaldo Carvalho de Melo | 7c65787 | 2005-08-09 20:14:34 -0700 | [diff] [blame] | 62 | endmenu |