| 1 |
<pre>Network Working Group T. Phelan |
| 2 |
Request for Comments: 5238 Sonus Networks |
| 3 |
Category: Standards Track May 2008 |
| 4 |
|
| 5 |
|
| 6 |
<span class="h1">Datagram Transport Layer Security (DTLS) over the Datagram</span> |
| 7 |
<span class="h1">Congestion Control Protocol (DCCP)</span> |
| 8 |
|
| 9 |
Status of This Memo |
| 10 |
|
| 11 |
This document specifies an Internet standards track protocol for the |
| 12 |
Internet community, and requests discussion and suggestions for |
| 13 |
improvements. Please refer to the current edition of the "Internet |
| 14 |
Official Protocol Standards" (STD 1) for the standardization state |
| 15 |
and status of this protocol. Distribution of this memo is unlimited. |
| 16 |
|
| 17 |
Abstract |
| 18 |
|
| 19 |
This document specifies the use of Datagram Transport Layer Security |
| 20 |
(DTLS) over the Datagram Congestion Control Protocol (DCCP). DTLS |
| 21 |
provides communications privacy for applications that use datagram |
| 22 |
transport protocols and allows client/server applications to |
| 23 |
communicate in a way that is designed to prevent eavesdropping and |
| 24 |
detect tampering or message forgery. DCCP is a transport protocol |
| 25 |
that provides a congestion-controlled unreliable datagram service. |
| 26 |
|
| 27 |
Table of Contents |
| 28 |
|
| 29 |
<a href="#section-1">1</a>. Introduction ....................................................<a href="#page-2">2</a> |
| 30 |
<a href="#section-2">2</a>. Terminology .....................................................<a href="#page-2">2</a> |
| 31 |
<a href="#section-3">3</a>. DTLS over DCCP ..................................................<a href="#page-2">2</a> |
| 32 |
<a href="#section-3.1">3.1</a>. DCCP and DTLS Sequence Numbers .............................<a href="#page-3">3</a> |
| 33 |
<a href="#section-3.2">3.2</a>. DCCP and DTLS Connection Handshakes ........................<a href="#page-3">3</a> |
| 34 |
<a href="#section-3.3">3.3</a>. Effects of DCCP Congestion Control .........................<a href="#page-4">4</a> |
| 35 |
3.4. Relationships between DTLS Sessions/Connections and DCCP |
| 36 |
Connections ................................................<a href="#page-5">5</a> |
| 37 |
<a href="#section-3.5">3.5</a>. PMTU Discovery .............................................<a href="#page-6">6</a> |
| 38 |
<a href="#section-3.6">3.6</a>. DCCP Service Codes .........................................<a href="#page-7">7</a> |
| 39 |
<a href="#section-3.7">3.7</a>. New Versions of DTLS .......................................<a href="#page-8">8</a> |
| 40 |
<a href="#section-4">4</a>. Security Considerations .........................................<a href="#page-8">8</a> |
| 41 |
<a href="#section-5">5</a>. Acknowledgments .................................................<a href="#page-8">8</a> |
| 42 |
<a href="#section-6">6</a>. References ......................................................<a href="#page-9">9</a> |
| 43 |
<a href="#section-6.1">6.1</a>. Normative References .......................................<a href="#page-9">9</a> |
| 44 |
<a href="#section-6.2">6.2</a>. Informative References .....................................<a href="#page-9">9</a> |
| 45 |
|
| 46 |
|
| 47 |
|
| 48 |
|
| 49 |
|
| 50 |
|
| 51 |
|
| 52 |
<span class="grey">Phelan Standards Track [Page 1]</span></pre> |
| 53 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span> |
| 54 |
<span class="grey"><a href="./rfc5238">RFC 5238</a> DTLS over DCCP May 2008</span> |
| 55 |
|
| 56 |
|
| 57 |
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span> |
| 58 |
|
| 59 |
This document specifies how to carry application payloads with |
| 60 |
Datagram Transport Layer Security (DTLS), as specified in [<a href="./rfc4347" title=""Datagram Transport Layer Security"">RFC4347</a>], |
| 61 |
in the Datagram Congestion Control Protocol (DCCP), as specified in |
| 62 |
[<a href="./rfc4340" title=""Datagram Congestion Control Protocol (DCCP)"">RFC4340</a>]. |
| 63 |
|
| 64 |
DTLS is an adaptation of Transport Layer Security (TLS, [<a href="./rfc4346" title=""The Transport Layer Security (TLS) Protocol Version 1.1"">RFC4346</a>]) |
| 65 |
that modifies TLS for use with the unreliable transport protocol UDP. |
| 66 |
TLS is a protocol that allows client/server applications to |
| 67 |
communicate in a way that is designed to prevent eavesdropping and |
| 68 |
detect tampering and message forgery. DTLS can be viewed as |
| 69 |
TLS-plus-adaptations-for-unreliability. |
| 70 |
|
| 71 |
DCCP provides an unreliable transport service, similar to UDP, but |
| 72 |
with adaptive congestion control, similar to TCP and Stream Control |
| 73 |
Transmission Protocol (SCTP). DCCP can be viewed equally well as |
| 74 |
either UDP-plus-congestion-control or TCP-minus-reliability |
| 75 |
(although, unlike TCP, DCCP offers multiple congestion control |
| 76 |
algorithms). |
| 77 |
|
| 78 |
The combination of DTLS and DCCP will offer transport security |
| 79 |
capabilities to applications using DCCP similar to those available |
| 80 |
for TCP, UDP, and SCTP. |
| 81 |
|
| 82 |
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Terminology</span> |
| 83 |
|
| 84 |
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", |
| 85 |
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this |
| 86 |
document are to be interpreted as described in [<a href="./rfc2119" title=""Key words for use in RFCs to Indicate Requirement Levels"">RFC2119</a>]. |
| 87 |
|
| 88 |
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. DTLS over DCCP</span> |
| 89 |
|
| 90 |
The approach here is very straightforward -- DTLS records are |
| 91 |
transmitted in the Application Data fields of DCCP-Data and |
| 92 |
DCCP-DataAck packets (in the rest of the document assume that |
| 93 |
"DCCP-Data packet" means "DCCP-Data or DCCP-DataAck packet"). |
| 94 |
Multiple DTLS records MAY be sent in one DCCP-Data packet, as long as |
| 95 |
the resulting packet is within the Path Maximum Transfer Unit (PMTU) |
| 96 |
currently in force for normal data packets, if fragmentation is not |
| 97 |
allowed (the Don't Fragment (DF) bit is set for IPv4 or no |
| 98 |
fragmentation extension headers are being used for IPv6), or within |
| 99 |
the current DCCP maximum packet size if fragmentation is allowed (see |
| 100 |
<a href="#section-3.5">Section 3.5</a> for more information on PMTU Discovery). A single DTLS |
| 101 |
record MUST be fully contained in a single DCCP-Data packet; it MUST |
| 102 |
NOT be split over multiple packets. |
| 103 |
|
| 104 |
|
| 105 |
|
| 106 |
|
| 107 |
|
| 108 |
<span class="grey">Phelan Standards Track [Page 2]</span></pre> |
| 109 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span> |
| 110 |
<span class="grey"><a href="./rfc5238">RFC 5238</a> DTLS over DCCP May 2008</span> |
| 111 |
|
| 112 |
|
| 113 |
<span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a>. DCCP and DTLS Sequence Numbers</span> |
| 114 |
|
| 115 |
Both DCCP and DTLS use sequence numbers in their packets/records. |
| 116 |
These sequence numbers serve somewhat, but not completely, |
| 117 |
overlapping functions. Consequently, there is no connection between |
| 118 |
the sequence number of a DCCP packet and the sequence number in a |
| 119 |
DTLS record contained in that packet, and there is no connection |
| 120 |
between sequence number-related features such as DCCP synchronization |
| 121 |
and DTLS anti-replay protection. |
| 122 |
|
| 123 |
<span class="h3"><a class="selflink" id="section-3.2" href="#section-3.2">3.2</a>. DCCP and DTLS Connection Handshakes</span> |
| 124 |
|
| 125 |
Unlike UDP, DCCP is connection-oriented, and has a connection |
| 126 |
handshake procedure that precedes the transmission of DCCP-Data and |
| 127 |
DCCP-DataAck packets. DTLS is also connection-oriented, and has a |
| 128 |
handshake procedure of its own that must precede the transmission of |
| 129 |
actual application information. Using the rule of mapping DTLS |
| 130 |
records to DCCP-Data and DCCP-DataAck packets in <a href="#section-3">Section 3</a>, above, |
| 131 |
the two handshakes are forced to happen in series, with the DCCP |
| 132 |
handshake first, followed by the DTLS handshake. This is how TLS |
| 133 |
over TCP works. |
| 134 |
|
| 135 |
However, the DCCP handshake packets DCCP-Request and DCCP-Response |
| 136 |
have Application Data fields and can carry user data during the DCCP |
| 137 |
handshake, and this creates the opportunity to perform the handshakes |
| 138 |
partially in parallel. DTLS client implementations MAY choose to |
| 139 |
transmit one or more DTLS records (typically containing DTLS |
| 140 |
handshake messages or parts of them) in the DCCP-Request packet. A |
| 141 |
DTLS server implementation MAY choose to process these records as |
| 142 |
usual, and if it has one or more DTLS records to send as a response |
| 143 |
(typically containing DTLS handshake messages or parts of them), it |
| 144 |
MAY include those records in the DCCP-Response packet. DTLS servers |
| 145 |
MAY also choose to delay the response until the DCCP handshake |
| 146 |
completes and then send the DTLS response in a DCCP-Data packet. |
| 147 |
|
| 148 |
Note that even though the DCCP handshake is a reliable process (DCCP |
| 149 |
handshake messages are retransmitted as required if messages are |
| 150 |
lost), the transfer of Application Data in DCCP-Request and |
| 151 |
DCCP-Response packets is not necessarily reliable. For example, DCCP |
| 152 |
server implementations are free to discard Application Data received |
| 153 |
in DCCP-Request packets. And if DCCP-Request or DCCP-Response |
| 154 |
packets need to be retransmitted, the DCCP implementation may choose |
| 155 |
to not include the Application Data present in the initial message. |
| 156 |
|
| 157 |
|
| 158 |
|
| 159 |
|
| 160 |
|
| 161 |
|
| 162 |
|
| 163 |
|
| 164 |
<span class="grey">Phelan Standards Track [Page 3]</span></pre> |
| 165 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span> |
| 166 |
<span class="grey"><a href="./rfc5238">RFC 5238</a> DTLS over DCCP May 2008</span> |
| 167 |
|
| 168 |
|
| 169 |
Since the DTLS handshake is also a reliable process, it will |
| 170 |
interoperate across the data delivery unreliability of DCCP (after |
| 171 |
all, one of the basic functions of DTLS is to work over unreliable |
| 172 |
transport). If the DTLS records containing DTLS handshake messages |
| 173 |
are lost, they will be retransmitted by DTLS. |
| 174 |
|
| 175 |
This is regardless of whether the messages were sent in |
| 176 |
DCCP-Response/Request packets or DCCP-Data packets. However, the |
| 177 |
only way for DTLS to retransmit DTLS records that were originally |
| 178 |
transmitted in DCCP-Request/Response packets (and they or the |
| 179 |
responses were lost somehow) is to wait for the DCCP handshake to |
| 180 |
complete and then resend the records in DCCP-Data packets. This is |
| 181 |
due to the characteristic of DCCP that the next opportunity to send |
| 182 |
data after sending data in a DCCP-Request is only after the |
| 183 |
connection handshake completes. |
| 184 |
|
| 185 |
DCCP and DTLS use similar strategies for retransmitting handshake |
| 186 |
messages. If there is no response to the original request |
| 187 |
(DCCP-Request or any DTLS handshake message where a response is |
| 188 |
expected) within normally 1 second, the message is retransmitted. |
| 189 |
The timer is then doubled and the process repeated until a response |
| 190 |
is received, or a maximum time is exceeded. |
| 191 |
|
| 192 |
Therefore, if DTLS records are sent in a DCCP-Request packet, and the |
| 193 |
DCCP-Request or DCCP-Response message is lost, the DCCP and DTLS |
| 194 |
handshakes could be timing out on similar schedules. The |
| 195 |
DCCP-Request packets will be retransmitted on timeout, but the DTLS |
| 196 |
records cannot be retransmitted until the DCCP handshake completes |
| 197 |
(there is no possibility of adding new Application Data to a |
| 198 |
DCCP-Request retransmission). In order to avoid multiple DTLS |
| 199 |
retransmissions queuing up before the first retransmission can be |
| 200 |
sent, DTLS over DCCP MUST wait until the completion of the DCCP |
| 201 |
handshake before restarting its DTLS handshake retransmission timer. |
| 202 |
|
| 203 |
<span class="h3"><a class="selflink" id="section-3.3" href="#section-3.3">3.3</a>. Effects of DCCP Congestion Control</span> |
| 204 |
|
| 205 |
Given the large potential sizes of the DTLS handshake messages, it is |
| 206 |
possible that DCCP congestion control could throttle the transmission |
| 207 |
of the DTLS handshake to the point that the transfer cannot complete |
| 208 |
before the DTLS timeout and retransmission procedures take effect. |
| 209 |
Adding retransmitted messages to a congested situation might only |
| 210 |
make matters worse and delay connection establishment. |
| 211 |
|
| 212 |
Note that a DTLS over UDP application transmitting handshake data |
| 213 |
into this same network situation will not necessarily receive better |
| 214 |
throughput, and might actually see worse effective throughput. |
| 215 |
|
| 216 |
|
| 217 |
|
| 218 |
|
| 219 |
|
| 220 |
<span class="grey">Phelan Standards Track [Page 4]</span></pre> |
| 221 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span> |
| 222 |
<span class="grey"><a href="./rfc5238">RFC 5238</a> DTLS over DCCP May 2008</span> |
| 223 |
|
| 224 |
|
| 225 |
Without the pacing of slow-start and congestion control, a UDP |
| 226 |
application might be making congestion worse and lowering the |
| 227 |
effective throughput it receives. |
| 228 |
|
| 229 |
As stated in [<a href="./rfc4347" title=""Datagram Transport Layer Security"">RFC4347</a>], "mishandling of the [retransmission] timer |
| 230 |
can lead to serious congestion problems". This remains as true for |
| 231 |
DTLS over DCCP as it is for DTLS over UDP. |
| 232 |
|
| 233 |
DTLS over DCCP implementations SHOULD take steps to avoid |
| 234 |
retransmitting a request that has been queued but not yet actually |
| 235 |
transmitted by DCCP, when the underlying DCCP implementation can |
| 236 |
provide this information. For example, DTLS could delay starting the |
| 237 |
retransmission timer until DCCP indicates the message has been |
| 238 |
transferred from DCCP to the IP layer. |
| 239 |
|
| 240 |
In addition to the retransmission issues, if the throughput needs of |
| 241 |
the actual application data differ from the needs of the DTLS |
| 242 |
handshake, it is possible that the handshake transference could leave |
| 243 |
the DCCP congestion control in a state that is not immediately |
| 244 |
suitable for the application data that will follow. For example, |
| 245 |
DCCP Congestion Control Identifier (CCID) 2 ([<a href="./rfc4341" title=""Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 2: TCP-like Congestion Control"">RFC4341</a>]) congestion |
| 246 |
control uses an Additive Increase Multiplicative Decrease (AIMD) |
| 247 |
algorithm similar to TCP congestion control. If it is used, then it |
| 248 |
is possible that transference of a large handshake could cause a |
| 249 |
multiplicative decrease that would not have happened with the |
| 250 |
application data. The application might then be throttled while |
| 251 |
waiting for additive increase to return throughput to acceptable |
| 252 |
levels. |
| 253 |
|
| 254 |
Applications where this might be a problem should consider using DCCP |
| 255 |
CCID 3 ([<a href="./rfc4342" title=""Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 3: TCP-Friendly Rate Control (TFRC)"">RFC4342</a>]). CCID 3 implements TCP-Friendly Rate Control |
| 256 |
(TFRC, [<a href="./rfc3448" title=""TCP Friendly Rate Control (TFRC): Protocol Specification"">RFC3448</a>])). TFRC varies the allowed throughput more slowly |
| 257 |
than AIMD and might avoid the discontinuities possible with CCID 2. |
| 258 |
|
| 259 |
<span class="h3"><a class="selflink" id="section-3.4" href="#section-3.4">3.4</a>. Relationships between DTLS Sessions/Connections and DCCP</span> |
| 260 |
<span class="h3"> Connections</span> |
| 261 |
|
| 262 |
DTLS uses the concepts of sessions and connections. A DTLS |
| 263 |
connection is used by upper-layer endpoints to exchange data over a |
| 264 |
transport protocol. DTLS sessions contain cached state information |
| 265 |
that is used to reduce the number of roundtrips and computation |
| 266 |
required to create multiple DTLS connections between the same |
| 267 |
endpoints. |
| 268 |
|
| 269 |
|
| 270 |
|
| 271 |
|
| 272 |
|
| 273 |
|
| 274 |
|
| 275 |
|
| 276 |
<span class="grey">Phelan Standards Track [Page 5]</span></pre> |
| 277 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span> |
| 278 |
<span class="grey"><a href="./rfc5238">RFC 5238</a> DTLS over DCCP May 2008</span> |
| 279 |
|
| 280 |
|
| 281 |
In DTLS over DCCP, a DTLS connection is carried by a DCCP connection. |
| 282 |
Often the DCCP connection establishment is immediately followed by |
| 283 |
DTLS connection establishment (either creating a new DTLS session |
| 284 |
with full handshake, or resuming an existing DTLS session), and the |
| 285 |
DTLS connection termination is immediately followed by DCCP |
| 286 |
connection termination, but this is not the only possibility. |
| 287 |
|
| 288 |
The life of a DTLS over DCCP connection is completely contained |
| 289 |
within the life of the underlying DCCP connection; a DTLS connection |
| 290 |
cannot continue if its underlying DCCP connection terminates. |
| 291 |
However, multiple DTLS connections can be resumed from the same DTLS |
| 292 |
session, each running over its own DCCP connection. The session |
| 293 |
resumption features of DTLS are widely used, and this situation is |
| 294 |
likely to occur in many use cases. It is also possible to resume a |
| 295 |
DTLS session with a new DTLS connection running over a different |
| 296 |
transport. |
| 297 |
|
| 298 |
Note that it is possible for an application to start a DCCP |
| 299 |
connection by transferring unprotected packets, and then switch to |
| 300 |
DTLS after some time. This is likely to be useful for applications |
| 301 |
that would like to negotiate using DTLS or not and has implications |
| 302 |
for the choice of DCCP Service Code. See <a href="#section-3.6">Section 3.6</a> for more |
| 303 |
information. |
| 304 |
|
| 305 |
Many DTLS Application Programming Interfaces (APIs) do not prevent an |
| 306 |
application from sending a mix of encrypted and clear packets over |
| 307 |
the same transport connection. Applications MUST NOT send |
| 308 |
unprotected data on a DCCP connection while it is also carrying a |
| 309 |
DTLS connection, since this presents a vulnerability to packet |
| 310 |
insertion attacks. |
| 311 |
|
| 312 |
Many DTLS APIs also allow an application to start multiple DTLS |
| 313 |
connections over one transport connection in series, with the |
| 314 |
termination of one DTLS connection followed by the start of another. |
| 315 |
Processing a DTLS handshake is relatively CPU intensive. An |
| 316 |
application that uses this strategy is open to an attacker that |
| 317 |
repeatedly starts and immediately stops sessions. Therefore, |
| 318 |
applications that use this strategy SHOULD limit the potential burden |
| 319 |
on the system by some means. For example, the application could |
| 320 |
enforce a minimum time of 1 second between session initiations. |
| 321 |
|
| 322 |
<span class="h3"><a class="selflink" id="section-3.5" href="#section-3.5">3.5</a>. PMTU Discovery</span> |
| 323 |
|
| 324 |
Each DTLS record must fit within a single DCCP-Data packet. DCCP |
| 325 |
packets are normally transmitted with the DF (Don't Fragment) bit set |
| 326 |
for IPv4 (or without fragmentation extension headers for IPv6). |
| 327 |
Because of this, DCCP performs Path Maximum Transmission Unit (PMTU) |
| 328 |
Discovery. |
| 329 |
|
| 330 |
|
| 331 |
|
| 332 |
<span class="grey">Phelan Standards Track [Page 6]</span></pre> |
| 333 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span> |
| 334 |
<span class="grey"><a href="./rfc5238">RFC 5238</a> DTLS over DCCP May 2008</span> |
| 335 |
|
| 336 |
|
| 337 |
DTLS also normally uses the DF bit and performs PMTU Discovery on its |
| 338 |
own, using an algorithm that is strongly similar to the one used by |
| 339 |
DCCP. A DTLS over DCCP implementation MAY use the DCCP-managed value |
| 340 |
for PMTU and not perform PMTU Discovery on its own. However, |
| 341 |
implementations that choose to use the DCCP-managed PMTU value SHOULD |
| 342 |
continue to follow the procedures of <a href="./rfc4347#section-4.1.1.1">Section 4.1.1.1 of [RFC4347]</a> |
| 343 |
with regard to fragmenting handshake messages during handshake |
| 344 |
retransmissions. Alternatively, a DTLS over DCCP implementation MAY |
| 345 |
choose to use its own PMTU Discovery calculations, as specified in |
| 346 |
[<a href="./rfc4347" title=""Datagram Transport Layer Security"">RFC4347</a>], but MUST NOT use a value greater than the value determined |
| 347 |
by DCCP. |
| 348 |
|
| 349 |
DTLS implementations normally allow applications to reset the PMTU |
| 350 |
estimate back to the initial state. When that happens, DTLS over |
| 351 |
DCCP implementations SHOULD also reset the DCCP PMTU estimation. |
| 352 |
|
| 353 |
DTLS implementations also sometimes allow applications to control the |
| 354 |
use of the DF bit (when running over IPv4) or the use of |
| 355 |
fragmentation extension headers (when running over IPv6). DTLS over |
| 356 |
DCCP implementations SHOULD control the use of the DF bit or |
| 357 |
fragmentation extension headers by DCCP in concert with the |
| 358 |
application's indications, when the DCCP implementation supports |
| 359 |
this. Note that DCCP implementations are not required to support |
| 360 |
sending fragmentable packets. |
| 361 |
|
| 362 |
Note that the DCCP Maximum Packet Size (MPS in [<a href="./rfc4340" title=""Datagram Congestion Control Protocol (DCCP)"">RFC4340</a>]) is bounded |
| 363 |
by the current congestion control state (Congestion Control Maximum |
| 364 |
Packet Size, CCMPS in [<a href="./rfc4340" title=""Datagram Congestion Control Protocol (DCCP)"">RFC4340</a>]). Even when the DF bit is not set |
| 365 |
and DCCP packets may then be fragmented, the MPS may be less than the |
| 366 |
65,535 bytes normally used in UDP. It is also possible for the DCCP |
| 367 |
CCMPS, and thus the MPS, to vary over time as congestion conditions |
| 368 |
change. DTLS over DCCP implementations MUST NOT use a DTLS record |
| 369 |
size that is greater than the DCCP MPS currently in force. |
| 370 |
|
| 371 |
<span class="h3"><a class="selflink" id="section-3.6" href="#section-3.6">3.6</a>. DCCP Service Codes</span> |
| 372 |
|
| 373 |
The DCCP connection handshake includes a field called Service Code |
| 374 |
that is intended to describe "the application-level service to which |
| 375 |
the client application wants to connect". Further, "Service Codes |
| 376 |
are intended to provide information about which application protocol |
| 377 |
a connection intends to use, thus aiding middleboxes and reducing |
| 378 |
reliance on globally well-known ports" [<a href="./rfc4340" title=""Datagram Congestion Control Protocol (DCCP)"">RFC4340</a>]. |
| 379 |
|
| 380 |
It is expected that many middleboxes will give different privileges |
| 381 |
to applications running DTLS over DCCP versus just DCCP. Therefore, |
| 382 |
applications that use DTLS over DCCP sometimes and just DCCP other |
| 383 |
times SHOULD register and use different Service Codes for each mode |
| 384 |
|
| 385 |
|
| 386 |
|
| 387 |
|
| 388 |
<span class="grey">Phelan Standards Track [Page 7]</span></pre> |
| 389 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span> |
| 390 |
<span class="grey"><a href="./rfc5238">RFC 5238</a> DTLS over DCCP May 2008</span> |
| 391 |
|
| 392 |
|
| 393 |
of operation. Applications that use both DCCP and DTLS over DCCP MAY |
| 394 |
choose to listen for incoming connections on the same DCCP port and |
| 395 |
distinguish the mode of the request by the offered Service Code. |
| 396 |
|
| 397 |
Some applications may start out using DCCP without DTLS, and then |
| 398 |
optionally switch to using DTLS over the same connection. Since |
| 399 |
there is no way to change the Service Code for a connection after it |
| 400 |
is established, these applications will use one Service Code. |
| 401 |
|
| 402 |
<span class="h3"><a class="selflink" id="section-3.7" href="#section-3.7">3.7</a>. New Versions of DTLS</span> |
| 403 |
|
| 404 |
As DTLS matures, revisions to and updates for [<a href="./rfc4347" title=""Datagram Transport Layer Security"">RFC4347</a>] can be |
| 405 |
expected. DTLS includes mechanisms for identifying the version in |
| 406 |
use, and presumably future versions will either include backward |
| 407 |
compatibility modes or at least not allow connections between |
| 408 |
dissimilar versions. Since DTLS over DCCP simply encapsulates the |
| 409 |
DTLS records transparently, these changes should not affect this |
| 410 |
document and the methods of this document should apply to future |
| 411 |
versions of DTLS. |
| 412 |
|
| 413 |
Therefore, in the absence of a revision to this document, this |
| 414 |
document is assumed to apply to all future versions of DTLS. This |
| 415 |
document will only be revised if a revision to DTLS or DCCP |
| 416 |
(including its related CCIDs) makes a revision to the encapsulation |
| 417 |
necessary. |
| 418 |
|
| 419 |
It is RECOMMENDED that an application migrating to a new version of |
| 420 |
DTLS keep the same DCCP Service Code used for the old version and |
| 421 |
allow DTLS to provide the version negotiation support. If a new |
| 422 |
version of DTLS provides significant new capabilities to the |
| 423 |
application that could change the behavior of middleboxes with regard |
| 424 |
to the application, an application developer MAY register a new |
| 425 |
Service Code. |
| 426 |
|
| 427 |
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Security Considerations</span> |
| 428 |
|
| 429 |
Security considerations for DTLS are specified in [<a href="./rfc4347" title=""Datagram Transport Layer Security"">RFC4347</a>] and for |
| 430 |
DCCP in [<a href="./rfc4340" title=""Datagram Congestion Control Protocol (DCCP)"">RFC4340</a>]. The combination of DTLS and DCCP introduces no |
| 431 |
new security considerations. |
| 432 |
|
| 433 |
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. Acknowledgments</span> |
| 434 |
|
| 435 |
The author would like to thank Eric Rescorla for initial guidance on |
| 436 |
adapting DTLS to DCCP, and Gorry Fairhurst, Pasi Eronen, Colin |
| 437 |
Perkins, Lars Eggert, Magnus Westerlund, and Tom Petch for comments |
| 438 |
on the document. |
| 439 |
|
| 440 |
|
| 441 |
|
| 442 |
|
| 443 |
|
| 444 |
<span class="grey">Phelan Standards Track [Page 8]</span></pre> |
| 445 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span> |
| 446 |
<span class="grey"><a href="./rfc5238">RFC 5238</a> DTLS over DCCP May 2008</span> |
| 447 |
|
| 448 |
|
| 449 |
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. References</span> |
| 450 |
|
| 451 |
<span class="h3"><a class="selflink" id="section-6.1" href="#section-6.1">6.1</a>. Normative References</span> |
| 452 |
|
| 453 |
[<a id="ref-RFC2119">RFC2119</a>] Bradner, S., "Key words for use in RFCs to Indicate |
| 454 |
Requirement Levels", <a href="https://www.rfc-editor.org/bcp/bcp14">BCP 14</a>, <a href="./rfc2119">RFC 2119</a>, March 1997. |
| 455 |
|
| 456 |
[<a id="ref-RFC4340">RFC4340</a>] Kohler, E., Handley, M., and S. Floyd, "Datagram |
| 457 |
Congestion Control Protocol (DCCP)", <a href="./rfc4340">RFC 4340</a>, March 2006. |
| 458 |
|
| 459 |
[<a id="ref-RFC4346">RFC4346</a>] Dierks, T. and E. Rescorla, "The Transport Layer Security |
| 460 |
(TLS) Protocol Version 1.1", <a href="./rfc4346">RFC 4346</a>, April 2006. |
| 461 |
|
| 462 |
[<a id="ref-RFC4347">RFC4347</a>] Rescorla, E. and N. Modadugu, "Datagram Transport Layer |
| 463 |
Security", <a href="./rfc4347">RFC 4347</a>, April 2006. |
| 464 |
|
| 465 |
|
| 466 |
<span class="h3"><a class="selflink" id="section-6.2" href="#section-6.2">6.2</a>. Informative References</span> |
| 467 |
|
| 468 |
[<a id="ref-RFC3448">RFC3448</a>] Handley, M., Floyd, S., Padhye, J., and J. Widmer, "TCP |
| 469 |
Friendly Rate Control (TFRC): Protocol Specification", <a href="./rfc3448">RFC</a> |
| 470 |
<a href="./rfc3448">3448</a>, January 2003. |
| 471 |
|
| 472 |
[<a id="ref-RFC4341">RFC4341</a>] Floyd, S. and E. Kohler, "Profile for Datagram Congestion |
| 473 |
Control Protocol (DCCP) Congestion Control ID 2: TCP-like |
| 474 |
Congestion Control", <a href="./rfc4341">RFC 4341</a>, March 2006. |
| 475 |
|
| 476 |
[<a id="ref-RFC4342">RFC4342</a>] Floyd, S., Kohler, E., and J. Padhye, "Profile for |
| 477 |
Datagram Congestion Control Protocol (DCCP) Congestion |
| 478 |
Control ID 3: TCP-Friendly Rate Control (TFRC)", <a href="./rfc4342">RFC 4342</a>, |
| 479 |
March 2006. |
| 480 |
|
| 481 |
Author's Address |
| 482 |
|
| 483 |
Tom Phelan |
| 484 |
Sonus Networks |
| 485 |
7 Technology Park Dr. |
| 486 |
Westford, MA USA 01886 |
| 487 |
Phone: 978-614-8456 |
| 488 |
Email: [email protected] |
| 489 |
|
| 490 |
|
| 491 |
|
| 492 |
|
| 493 |
|
| 494 |
|
| 495 |
|
| 496 |
|
| 497 |
|
| 498 |
|
| 499 |
|
| 500 |
<span class="grey">Phelan Standards Track [Page 9]</span></pre> |
| 501 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span> |
| 502 |
<span class="grey"><a href="./rfc5238">RFC 5238</a> DTLS over DCCP May 2008</span> |
| 503 |
|
| 504 |
|
| 505 |
Full Copyright Statement |
| 506 |
|
| 507 |
Copyright (C) The IETF Trust (2008). |
| 508 |
|
| 509 |
This document is subject to the rights, licenses and restrictions |
| 510 |
contained in <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a>, and except as set forth therein, the authors |
| 511 |
retain all their rights. |
| 512 |
|
| 513 |
This document and the information contained herein are provided on an |
| 514 |
"AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS |
| 515 |
OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE IETF TRUST AND |
| 516 |
THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS |
| 517 |
OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF |
| 518 |
THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED |
| 519 |
WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. |
| 520 |
|
| 521 |
Intellectual Property |
| 522 |
|
| 523 |
The IETF takes no position regarding the validity or scope of any |
| 524 |
Intellectual Property Rights or other rights that might be claimed to |
| 525 |
pertain to the implementation or use of the technology described in |
| 526 |
this document or the extent to which any license under such rights |
| 527 |
might or might not be available; nor does it represent that it has |
| 528 |
made any independent effort to identify any such rights. Information |
| 529 |
on the procedures with respect to rights in RFC documents can be |
| 530 |
found in <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a> and <a href="https://www.rfc-editor.org/bcp/bcp79">BCP 79</a>. |
| 531 |
|
| 532 |
Copies of IPR disclosures made to the IETF Secretariat and any |
| 533 |
assurances of licenses to be made available, or the result of an |
| 534 |
attempt made to obtain a general license or permission for the use of |
| 535 |
such proprietary rights by implementers or users of this |
| 536 |
specification can be obtained from the IETF on-line IPR repository at |
| 537 |
<a href="http://www.ietf.org/ipr">http://www.ietf.org/ipr</a>. |
| 538 |
|
| 539 |
The IETF invites any interested party to bring to its attention any |
| 540 |
copyrights, patents or patent applications, or other proprietary |
| 541 |
rights that may cover technology that may be required to implement |
| 542 |
this standard. Please address the information to the IETF at |
| 543 |
[email protected]. |
| 544 |
|
| 545 |
|
| 546 |
|
| 547 |
|
| 548 |
|
| 549 |
|
| 550 |
|
| 551 |
|
| 552 |
|
| 553 |
|
| 554 |
|
| 555 |
|
| 556 |
Phelan Standards Track [Page 10] |
| 557 |
</pre> |