OLD | NEW |
1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 5 #ifndef NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
6 #define NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 6 #define NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
7 | 7 |
8 #include <string> | 8 #include <string> |
9 | 9 |
10 #include "net/base/net_export.h" | 10 #include "net/base/net_export.h" |
(...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
52 | 52 |
53 // Connection options (COPT) values | 53 // Connection options (COPT) values |
54 const QuicTag kTBBR = TAG('T', 'B', 'B', 'R'); // Reduced Buffer Bloat TCP | 54 const QuicTag kTBBR = TAG('T', 'B', 'B', 'R'); // Reduced Buffer Bloat TCP |
55 const QuicTag kRENO = TAG('R', 'E', 'N', 'O'); // Reno Congestion Control | 55 const QuicTag kRENO = TAG('R', 'E', 'N', 'O'); // Reno Congestion Control |
56 const QuicTag kIW10 = TAG('I', 'W', '1', '0'); // Force ICWND to 10 | 56 const QuicTag kIW10 = TAG('I', 'W', '1', '0'); // Force ICWND to 10 |
57 const QuicTag kPACE = TAG('P', 'A', 'C', 'E'); // Paced TCP cubic | 57 const QuicTag kPACE = TAG('P', 'A', 'C', 'E'); // Paced TCP cubic |
58 const QuicTag k1CON = TAG('1', 'C', 'O', 'N'); // Emulate a single connection | 58 const QuicTag k1CON = TAG('1', 'C', 'O', 'N'); // Emulate a single connection |
59 const QuicTag kNTLP = TAG('N', 'T', 'L', 'P'); // No tail loss probe | 59 const QuicTag kNTLP = TAG('N', 'T', 'L', 'P'); // No tail loss probe |
60 const QuicTag kNCON = TAG('N', 'C', 'O', 'N'); // N Connection Congestion Ctrl | 60 const QuicTag kNCON = TAG('N', 'C', 'O', 'N'); // N Connection Congestion Ctrl |
61 const QuicTag kNRTO = TAG('N', 'R', 'T', 'O'); // CWND reduction on loss | 61 const QuicTag kNRTO = TAG('N', 'R', 'T', 'O'); // CWND reduction on loss |
62 | |
63 // Loss detection algorithm types | |
64 const QuicTag kNACK = TAG('N', 'A', 'C', 'K'); // TCP style nack counting | |
65 const QuicTag kTIME = TAG('T', 'I', 'M', 'E'); // Time based | 62 const QuicTag kTIME = TAG('T', 'I', 'M', 'E'); // Time based |
66 | 63 |
67 // Optional support of truncated Connection IDs. If sent by a peer, the value | 64 // Optional support of truncated Connection IDs. If sent by a peer, the value |
68 // is the minimum number of bytes allowed for the connection ID sent to the | 65 // is the minimum number of bytes allowed for the connection ID sent to the |
69 // peer. | 66 // peer. |
70 const QuicTag kTCID = TAG('T', 'C', 'I', 'D'); // Connection ID truncation. | 67 const QuicTag kTCID = TAG('T', 'C', 'I', 'D'); // Connection ID truncation. |
71 | 68 |
72 // FEC options | 69 // FEC options |
73 const QuicTag kFHDR = TAG('F', 'H', 'D', 'R'); // FEC protect headers | 70 const QuicTag kFHDR = TAG('F', 'H', 'D', 'R'); // FEC protect headers |
74 | 71 |
(...skipping 98 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
173 // amplification factor of any mirror DoS attack. | 170 // amplification factor of any mirror DoS attack. |
174 // | 171 // |
175 // A client may pad an inchoate client hello to a size larger than | 172 // A client may pad an inchoate client hello to a size larger than |
176 // kClientHelloMinimumSize to make it more likely to receive a complete | 173 // kClientHelloMinimumSize to make it more likely to receive a complete |
177 // rejection message. | 174 // rejection message. |
178 const size_t kClientHelloMinimumSize = 1024; | 175 const size_t kClientHelloMinimumSize = 1024; |
179 | 176 |
180 } // namespace net | 177 } // namespace net |
181 | 178 |
182 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 179 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
OLD | NEW |