- Home
- RFC 9897
RFC 9897: Datagram Congestion Control Protocol (DCCP) Extensions for Multipath Operation with Multiple Addresses
- M. Amend, Ed.,
- A. Brunstrom,
- A. Kassler,
- V. Rakocevic,
- S. Johnson
Abstract
Datagram Congestion Control Protocol (DCCP) communications, as defined in RFC 4340, are inherently restricted to a single path per connection, despite the availability of multiple network paths between peers. The ability to utilize multiple paths simultaneously for a DCCP session can enhance network resource utilization, improve throughput, and increase resilience to network failures, ultimately enhancing the user experience.¶
Use cases for Multipath DCCP (MP-DCCP) include mobile devices (e.g., handsets and vehicles) and residential home gateways that maintain simultaneous connections to distinct network types such as cellular and Wireless Local Area Networks (WLANs) or cellular and fixed access networks. Compared to existing multipath transport protocols, such as Multipath TCP (MPTCP), MP-DCCP is particularly suited for latency
This document specifies a set of protocol extensions to DCCP that enable multipath operations. These extensions maintain the same service model as DCCP while introducing mechanisms to establish and utilize multiple concurrent DCCP flows across different network paths.¶
Status of This Memo
This is an Internet Standards Track document.¶
This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Further information on Internet Standards is available in Section 2 of RFC 7841.¶
Information about the current status of this document, any
errata, and how to provide feedback on it may be obtained at
https://
Copyright Notice
Copyright (c) 2026 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(https://
1. Introduction
The Datagram Congestion Control Protocol (DCCP) [RFC4340]
is a transport protocol that provides bidirectional unicast connections
of congestion
Multipath DCCP (MP-DCCP)
enables a DCCP connection to simultaneously establish a flow across multiple paths. This can be beneficial to applications that transfer
large amounts of data, by utilizing the capacity
In addition to the integration into DCCP services, implementers or future specifications could choose MP-DCCP for other use cases such as 3GPP 5G multi-access solutions (e.g., Access Traffic Steering, Switching, and Splitting (ATSSS) specified in [TS23.501]) or hybrid access networks. ATSSS combines 3GPP and non-3GPP access between the user equipment and an operator network, while hybrid access combines fixed and cellular access between a residential gateway and an operator network. MP-DCCP can be used in these scenarios for load balancing, seamless session handover, and bandwidth aggregation when non-DCCP traffic such as IP, UDP, or TCP is encapsulated into MP-DCCP. More details on potential use cases for MP-DCCP are provided in [MP-DCCP.Site], [IETF105.Slides], and [MP-DCCP.Paper]. All of these use cases profit from an Open Source Linux reference implementation provided under [MP-DCCP.Site].¶
The encapsulation of non-DCCP traffic (e.g., UDP or IP) in MP-DCCP to enable the above-mentioned use cases is not considered in this specification. Also out of scope is the encapsulation of DCCP traffic in UDP to pass middleboxes (e.g., NATs, firewalls, proxies, intrusion detection systems (IDSs), etc.) that do not support DCCP. However, a possible method is defined in [RFC6773] and considered in [U-DCCP] to achieve the same with less overhead.¶
MP-DCCP is based exclusively on the lean concept of DCCP. For traffic that is already encrypted or does not need encryption, MP-DCCP is an efficient choice as it does not apply its own encryption mechanisms. Also, the procedures defined by MP-DCCP, which allow subsequent reordering of traffic and efficient traffic scheduling, improve performance, as shown in [MP-DCCP.Paper], and take into account the interaction of the protocol with the further elements required for multipath transport.¶
1.1. Multipath DCCP in the Networking Stack
MP-DCCP provides a set of features to DCCP; Figure 1 illustrates this layering. MP-DCCP is designed to be used by applications in the same way as DCCP with no changes to the application itself.¶
+-------------------------------+
| Application |
+---------------+ +-------------------------------+
| Application | | MP-DCCP |
+---------------+ + - - - - - - - + - - - - - - - +
| DCCP | |Subflow (DCCP) |Subflow (DCCP) |
+---------------+ +-------------------------------+
| IP | | IP | IP |
+---------------+ +-------------------------------+A command-line interface (CLI) at the endpoint (or another method) could be used to configure and manage the DCCP connections. This could be extended to also support MP-DCCP, but this specification does not define it.¶
1.2. Terminology
This document uses terms that are either specific for multipath transport as defined in [RFC8684] or defined in the context of MP-DCCP, as follows:¶
- Path:
-
A sequence of links between a sender and a receiver, defined in this context by a 4-tuple of the source and destination address and the source and destination ports. This definition follows [RFC8684] and is illustrated in the following two examples for IPv6 and IPv4, which each show a pair of sender IP-address:port and a pair of receiver IP
-address :port, which together form the 4-tuple:¶ - Subflow:
- A DCCP flow that is transmitted by using a specific path (4-tuple of source and destination address/port pairs) that forms one of the multipath flows used by a single connection.¶
- (MP-DCCP) Connection:
- A set of one or more subflows, over which an application can communicate between two hosts. The MP-DCCP connection is exposed as a single DCCP socket to the application.¶
- Connection Identifier (CI):
- A unique identifier that is assigned to a multipath connection by the host to distinguish several multipath connections locally. The CIs must therefore be locally unique per host and do not have to be the same across the peers.¶
- Host:
- An end host that operates an MP-DCCP implementation and either initiates or accepts an MP-DCCP connection.¶
- '+':
- The plus symbol means the concatenation of values.¶
In addition to these terms, within the framework of MP-DCCP, the interpretation of, and effect on, regular single-path DCCP semantics is discussed in Section 3.¶
1.3. Requirements Language
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here.¶
2. Operation Overview
DCCP transmits congestion
At a high level of MP-DCCP operation, the data stream from a DCCP application is split by the MP-DCCP operation into one or more subflows that can be transmitted via different paths, for example, using paths via different links. The corresponding control information allows the receiver to optionally reassemble and deliver the received data in the originally transmitted order to the recipient application. This may be necessary because DCCP does not guarantee in-order delivery. The details of the transmission scheduling mechanism and optional reordering mechanism are up to the sender and receiver, respectively, and are outside the scope of this document.¶
An MP-DCCP connection provides a bidirectional connection of datagrams between two hosts exchanging data using DCCP. It does not require any change to the applications. MP-DCCP enables the hosts to use multiple paths with different 4-tuples to transport the packets of an MP-DCCP connection. MP-DCCP manages the request, set-up, authentication, prioritization, modification, and removal of the DCCP subflows on different paths as well as the exchange of performance parameters.¶
The number of DCCP subflows can vary during the lifetime of an MP-DCCP connection. The details of the path management decisions for when to add or remove subflows are outside the scope of this document.¶
The multipath capability for MP-DCCP is negotiated with a new DCCP
feature, as specified in Section 3.1. Once
negotiated, all subsequent MP-DCCP operations for that connection are signaled with a
variable length multipath
The sections that follow define MP-DCCP behavior in detail.¶
2.1. MP-DCCP Concept
Figure 2 provides a general overview of the MP-DCCP working mode, whose main characteristics are summarized in this section.¶
Host A Host B ------------------------ ------------------------ Address A1 Address A2 Address B1 Address B2 ---------- ---------- ---------- ---------- | | | | | (DCCP subflow setup) | | |----------------------------------->| | |<-----------------------------------| | | | | | | | (DCCP subflow setup)| | | |--------------------->| | | |<---------------------| | | merge individual DCCP subflows to one MP-DCCP connection | | | |
-
An MP-DCCP connection begins with a 4-way handshake between two hosts. In Figure 2, an MP-DCCP connection is established between addresses A1 and B1 on Hosts A and B. In the handshake, a Multipath Capable Feature is used to negotiate multipath support for the connection. Host-specific keys are also exchanged between Host A and Host B during the handshake. The details of the MP-DCCP handshake procedure is described in Section 3.3. MP-DCCP does not require both peers to have more than one address.¶
-
When additional paths and corresponding addresses/ports are available, additional DCCP subflows can be created on these paths and attached to the existing MP-DCCP connection. An MP_
JOIN option is used to connect a new DCCP subflow to an existing MP-DCCP connection. It contains a Connection Identifier (CI) during the setup of the initial subflow and is exchanged in the 4-way handshake for the subflow together with the Multipath Capable Feature. The example in Figure 2 illustrates the creation of an additional DCCP subflow between Address A2 on Host A and Address B1 on Host B. The two subflows continue to provide a single connection to the applications at both endpoints.¶ -
MP-DCCP identifies multiple paths by the presence of multiple addresses/ports at hosts. Combinations of these multiple addresses/ports indicate the additional paths. In the example, other potential paths that could be set up are A1<->B2 and A2<->B2. Although the additional subflow in the example is shown as being initiated from A2, an additional subflow could alternatively have been initiated from B1 or B2.¶
-
The discovery and setup of additional subflows is achieved through a path management method including the logic and details of the procedures for adding/removing subflows. This document describes the procedures that enable a host to initiate new subflows or to signal available IP addresses between peers. However, the definition of a path management method, in which sequence and when subflows are created, is outside the scope of this document. This method is subject to a corresponding policy and the specifics of the implementation. If an MP-DCCP peer host wishes to limit the maximum number of paths that can be maintained (e.g., similar to that discussed in Section 3.4 of [RFC8041]), the creation of new subflows from that peer host is omitted when the threshold of maximum paths is exceeded and incoming subflow requests MUST be rejected.¶
-
Through the use of Multipath Options, MP-DCCP adds connection
-level sequence numbers and the exchange of Round-Trip Time (RTT) information to enable optional reordering features. As a hint for scheduling decisions, a Multipath Option that allows a peer to indicate its priorities for which path to use is also defined.¶ -
Subflows are terminated in the same way as regular DCCP connections, as described in Section 8.3 of [RFC4340]. MP-DCCP connections are closed by including an MP_
CLOSE option in subflow DCCP-CloseReq or DCCP-Close messages. An MP-DCCP connection may also be reset through the use of an MP_ FAST_ CLOSE option. Key Data from the initial handshake is included in MP_ CLOSE and MP_ FAST_ CLOSE to protect from an unauthorized shutdown of MP-DCCP connections.¶
3. MP-DCCP Protocol
The DCCP protocol feature list (Section 6.4 of [RFC4340]) is extended in this document by adding a new Multipath Feature with Feature Number 10, as shown in Table 1.¶
| Number | Meaning | Rec'n Rule | Initial Value | Req'd |
|---|---|---|---|---|
| 10 | Multipath Capable | SP | 0 | N |
- Rec'n Rule:
-
The reconciliation rule used for the feature. SP indicates the server-priority as defined in Section 6.3 of [RFC4340].¶
- Initial Value:
-
The initial value for the feature. Every feature has a known initial value.¶
- Req'd:
-
This column is "Y" if and only if every DCCP implementation MUST understand the feature. If it is "N", then the feature behaves like an extension, and it is safe to respond to Change options for the feature with empty Confirm options.¶
This specification adds a DCCP protocol option as defined in Section 5.8 of [RFC4340], providing
a new multipath
| Type | Option Length | Meaning | DCCP-Data? |
|---|---|---|---|
| 46 | variable | Multipath | Y |
3.1. Multipath Capable Feature
A DCCP endpoint negotiates the Multipath Capable Feature to determine whether multipath extensions can be enabled for a DCCP connection.¶
The Multipath Capable Feature
0 1 2 3 4 5 6 7 +-----------+------------+ | Version | Unassigned | +-----------+------------+
The setting of the Multipath Capable Feature MUST follow the server-priority reconciliation rule described in Section 6.3.1 of [RFC4340]. This allows multiple versions to be specified in order of priority.¶
The negotiation MUST be a part of the initial handshake procedure described in Section 3.3. No subsequent renegotiation of the Multipath Capable Feature is allowed for the same MP-DCCP connection.¶
Clients MUST include a Change R option (Section 6 of [RFC4340]) during the initial handshake request to supply a list of supported MP-DCCP protocol versions, ordered by preference.¶
Servers MUST include a Confirm L option (Section 6 of [RFC4340]) in the subsequent response to agree on an MP-DCCP version to be used from the Client list, followed by its own supported version(s), ordered by preference. Any subflow added to an existing MP-DCCP connection MUST use the version negotiated for the first subflow.¶
If no agreement is found, the Server MUST reply with an empty Confirm L option with Feature Number 10 and no values.¶
An example of successful version negotiation is shown hereafter and follows the negotiation example shown in Section 6.5 of [RFC4340]. For better understanding, this example uses the unspecified MP-DCCP versions 1 and 2 in addition to the MP-DCCP version 0 specified in this document:¶
Client Server
------ ------
DCCP-Req + Change R(MP_CAPABLE, 1 0)
----------------------------------->
DCCP-Resp + Confirm L(MP_CAPABLE, 1, 2 1 0)
<-----------------------------------
* agreement on version = 1 *This example illustrates the following:¶
-
The Client indicates support for both MP-DCCP versions 1 and 0, with a preference for version 1.¶
-
The Server agrees on using MP-DCCP version 1 indicated by the first value and supplies its own preference list with the subsequent values.¶
-
MP-DCCP is then enabled between the Client and Server with version 1.¶
Unlike the example in Figure 4, this document only allows the negotiation of MP-DCCP version 0. Therefore, per successful negotiation of MP-DCCP as defined in this document, the Client and the Server MUST both support MP-DCCP version 0.¶
If the version negotiation fails or the Multipath Capable Feature is not present in the DCCP-Request or DCCP-Response packets of the initial handshake procedure, the MP-DCCP connection either MUST fall back to regular DCCP or MUST close the connection. Further details are specified in Section 3.6.¶
3.2. Multipath Option
MP-DCCP uses one single option to signal various multipath
1 2 3 01234567 89012345 67890123 45678901 23456789 +--------+--------+--------+--------+--------+ |00101110| Length | MP_OPT | Value(s) ... +--------+--------+--------+--------+--------+ Type=46
The fields used by the Multipath Option are described in Table 3. MP_
| Type | Option Length | MP_ |
Meaning |
|---|---|---|---|
| 46 | var | 0 |
Confirm reception and processing of an MP_ |
| 46 | 12 | 1 |
Join subflow to an existing MP-DCCP connection |
| 46 | var | 2 |
Close an MP-DCCP connection unconditionally |
| 46 | var | 3 |
Exchange key material for MP_ |
| 46 | 9 | 4 |
Multipath sequence number |
| 46 | 23 | 5 |
Hash-based message authentication code for MP-DCCP |
| 46 | 12 | 6 |
Transmit RTT values and calculation parameters |
| 46 | var | 7 |
Advertise one or more additional addresses/ports |
| 46 | 8 | 8 |
Remove one or more addresses/ports |
| 46 | 4 | 9 |
Change subflow priority |
| 46 | var | 10 |
Close an MP-DCCP connection |
| 46 | var | 11 |
Experimental option for private use |
| 46 | TBD | >11 | (available for future Multipath Options) |
Future Multipath Options could be defined in a later version of or extension to this specification.¶
These operations are largely inspired by the signals defined in [RFC8684]. The procedures for handling faulty or unknown Multipath Options are described in Section 3.6.¶
3.2.1. MP_CONFIRM
Some Multipath Options require confirmation from the remote peer (see Table 4) for which MP_
1 2 3 4 5 01234567 89012345 67890123 45678901 23456789 01234567 89012345 +--------+--------+--------+--------+--------+--------+--------+ |00101110| var |00000000| List of confirmations ... +--------+--------+--------+--------+--------+--------+--------+ Type=46 Length MP_OPT=0
Multipath Options that require confirmation will be retransmitted by the sender until an MP_
This can happen, for example, with an MP_
Multipath Options could arrive out of order; therefore, Multipath Options defined in Table 4
MUST be sent in a DCCP datagram with MP_
Similarly, an MP_
The length of the MP_
| Type | Option Length | MP_ |
MP_ |
|---|---|---|---|
| 46 | var | 7 |
Any available |
| 46 | 4 | 8 |
Any available |
| 46 | 4 | 9 |
Any available |
An example to illustrate the MP-DCCP confirm procedure for the MP_
Host A Host B
------------------------ ------------------------
Address A1 Address A2 Address B1 Address B2
---------- ---------- ---------- ----------
| | | |
| | DCCP-Request(seqno 1) + MP_PRIO(1)| |
| |------------------------------------------>|
| | | |
| | DCCP-Response + | |
| |<---- MP_CONFIRM(seqno 1, MP_PRIO) --------|
| | | |A second example that illustrates the same MP-DCCP confirm procedure but where an out-of-date option is also delivered is shown in Figure 8.
Here, the first DCCP-Data is sent from Host A to Host B with option MP_
Host A Host B
------------------------ ------------------------
Address A1 Address A2 Address B1 Address B2
---------- ---------- ---------- ----------
| | | |
| | DCCP-Data(seqno 1) + MP_PRIO(4) | |
| |------------ | |
| | \ | |
| | DCCP-Data(seqno 2) + MP_PRIO(1) | |
| |--------------\--------------------------->|
| | \ | |
| | -------------------------->|
| | | |
| | DCCP-Ack + | |
| |<---- MP_CONFIRM(seqno 2, MP_PRIO) --------|
| | | |
3.2.2. MP_JOIN
The MP_
1 2 3 01234567 89012345 67890123 45678901 +--------+--------+--------+--------+ |00101110|00001100|00000001| Addr ID| +--------+--------+--------+--------+ | Connection Identifier | +--------+--------+--------+--------+ | Nonce | +--------+--------+--------+--------+ Type=46 Length=12 MP_OPT=1
The CI is the one from the peer host,
which was previously exchanged with the MP_
The MP_
The Address IDs of the subflow used in the initial DCCP Request
The Nonce is a 32-bit random value locally generated for every MP_
If the CI cannot be verified by the receiving host during a handshake negotiation, the new subflow MUST be closed, as specified in Section 3.6.¶
3.2.3. MP_FAST_CLOSE
DCCP can send a Close or Reset signal to abruptly close a
connection. Using MP-DCCP, a regular Close or Reset only has the scope of the
subflow over which a signal was received.
As such, it will only close the subflow and does not
affect other remaining subflows or the MP-DCCP connection (unless it is the last
subflow).
This permits break
In order to provide an MP-DCCP-level
"reset" and thus allow the abrupt closure of the MP-DCCP connection, the MP_
1 2 3 01234567 89012345 67890123 45678901 23456789 +--------+--------+--------+--------+--------+ |00101110| var |00000010| Key Data ... +--------+--------+--------+--------+--------+ Type=46 Length MP_OPT=2
When Host A wants to abruptly close an MP-DCCP connection with Host B, it will send out the MP_
After sending the MP_
Upon reception of the first MP_
3.2.4. MP_KEY
MP-DCCP protects against some on-path attacker as further outlined in Section 4. The basis of this protection is laid by an initial exchange of keys during the MP-DCCP connection setup, for which MP_
1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+---------------+---------------+---------------+---------------+
|0 0 1 0 1 1 1 0| var |0 0 0 0 0 0 1 1| resvd |
+---------------+---------------+---------------+---------------+
| Connection Identifier |
+---------------+---------------+---------------+---------------+
| Key Type (1) | Key Data (1) | Key Type (2) | Key Data (2) |
+---------------+---------------+---------------+---------------+
| Key Type (3) | ...
+---------------+---------------+
Type=46 Length MP_OPT=3The MP_
| Key Type | Key Length (bytes) | Meaning |
|---|---|---|
| 0 =Plain Text | 8 | Plain text Key |
| 1-254 | (available for future Key Types) | |
| 255 =Experimental | 64 | For private use only |
- Plain Text:
-
Key Data is exchanged in plain text between hosts (Host A and Host B), and the respective key parts (KeyA and KeyB) are used by each host to generate the derived key (d-key) by concatenating the two parts with the local key in front. That is,¶
- Experimental:
-
This Key Type allows the use of other Key Data and can be used to validate other key exchange mechanisms for a possible future specification.¶
Multiple keys are only permitted in the DCCP-Request message of the handshake procedure for the first subflow. This allows the hosts to agree on a single Key Type to be used, as described in Section 3.3¶
It is possible that not all hosts will support all Key Types, and this specification does not
recommend or enforce the announcement of any particular Key Type within the MP_
3.2.5. MP_SEQ
DCCP [RFC4340] defines a packet sequencing scheme that continues to apply to the individual DCCP subflows within an MP-DCCP connection. However, for the operation of MP-DCPP, the order of packets within an MP-DCCP connection MUST be known before assigning packets to subflows to apply the received Multipath Options in the correct order or to recognize whether delayed Multipath Options are obsolete. Therefore, MP_
1 2 3 4 5
01234567 89012345 67890123 45678901 23456789 01234567 89012345
+--------+--------+--------+--------+--------+--------+--------+
|00101110|00001001|00000100| Multipath Sequence Number
+--------+--------+--------+--------+--------+--------+--------+
|
+--------+--------+
Type=46 Length=9 MP_OPT=4The MP_
The MP_
When the sequence number space is exhausted, the sequence number MUST
be wrapped. [RFC7323] provides guidance on selecting an appropriately
sized sequence number space according to the Maximum Segment Lifetime (MSL) of
TCP. 64 bits is the recommended size for TCP to avoid the sequence number
space going through within the segment lifetime. For DCCP, the MSL is the same as that of TCP as specified in Section 3.4 of [RFC4340].
Compared to TCP, the sequence number for DCCP is incremented
per packet rather than per byte transmitted. For this reason, the 48 bits
chosen in MP_
3.2.6. MP_HMAC
MP-DCCP protects against some on-path attacker as further outlined in Section 4. Once an MP-DCCP connection has been established, the MP_
1 2 3 4 01234567 89012345 67890123 45678901 23456789 01234567 +--------+--------+--------+--------+--------+--------+ |00101110|00010111|00000101| HMAC-SHA256 (20 bytes) ... +--------+--------+--------+--------+--------+--------+ Type=46 Length=23 MP_OPT=5
The MP_
The "Key" used for the HMAC computation is the derived key (d-keyA for Host A or d-KeyB for Host B)
described in Section 3.2.4, while the HMAC "Message" for MP_
-
For MP_
JOIN : The Nonces of the MP_ JOIN messages for which authentication shall be performed. Depending on whether Host A or Host B performs the HMAC-SHA256 calculation, it is carried out as follows:¶
A usage example is shown in Figure 21.¶
-
For MP_
ADDADDR : The Address ID and Nonce with an associated IP address and a port, if defined; otherwise, 2 bytes of value 0. The IP address and port MUST be used in network byte order (NBO). Depending on whether Host A or Host B performs the HMAC-SHA256 calculation, it is carried out as follows:¶ -
For MP_
REMOVEADDR : Solely the Address ID. Depending on whether Host A or Host B performs the HMAC-SHA256 calculation, it is carried out as follows:¶
MP_
On the receiver side, the HMAC validation of the suboptions MUST be carried out according to
the sending sequence in which the associated MP_
In the event that an MP_
3.2.7. MP_RTT
The MP_
1 2 3 4 5
01234567 89012345 67890123 45678901 23456789 01234567 89012345
+--------+--------+--------+--------+--------+--------+--------+
|00101110|00001100|00000110|RTT Type| RTT
+--------+--------+--------+--------+--------+--------+--------+
| Age |
+--------+--------+--------+--------+--------+
Type=46 Length=12 MP_OPT=6The RTT and Age information is a 32-bit integer. This covers a period of approximately 1193 hours.¶
The Field RTT type indicates the type of RTT estimation, according to the following description:¶
- Raw RTT (=0)
-
Raw RTT value of the last Datagram round trip.¶
- Min RTT (=1)
-
Min RTT value over a given period.¶
- Max RTT (=2)
-
Max RTT value over a given period.¶
- Smooth RTT (=3)
-
Averaged RTT value over a given period.¶
Each CCID specifies the algorithms and period applied for their corresponding RTT estimations. The availability of the above-described types, to be used in the MP_
- Age:
-
The Age parameter defines the time difference between now -- the creation of the MP_
RTT option -- and the conducted RTT measurement in milliseconds. If no previous measurement exists, e.g., when initialized, the value is 0.¶
An example of a flow showing the exchange of path individual
RTT information is provided in
Figure 15.
RTT1 refers to the first path and RTT2 to the second path. The
RTT values could be extracted from the sender's congestion control algorithm and are conveyed to the receiving host using the MP_
MP-DCCP MP-DCCP Sender Receiver +--------+ MP_RTT(RTT1) +-------------+ | RTT1 |----------------| | | | | path_delta= | | | MP_RTT(RTT2) | |RTT1-RTT2| | | RTT2 |----------------| | +--------+ +-------------+
3.2.8. MP_ADDADDR
The MP_
The Length is variable depending on the address family (IPv4 or IPv6) and whether a port number is used. This field is in the range between 12 and 26 bytes.¶
The Nonce is a 32-bit random value that is generated locally for
each MP_
The final 2 bytes optionally specify the DCCP port number to
use, and their presence can be inferred from the length of the option.
Although it is expected that the majority of use cases will use the
same port pairs as used for the initial subflow (e.g., port 80
remains port 80 on all subflows, as does the ephemeral port at the
client), there could be cases (such as port-based load balancing) where
the explicit specification of a different port is required. If no
port is specified, the receiving host MUST assume that any attempt to
connect to the specified address uses the port already used by the
subflow on which the MP_
Along with the MP_
The presence of an MP_
1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+---------------+---------------+-------+-------+---------------+
|0 0 1 0 1 1 1 0| var |0 0 0 0 0 1 1 1| Address ID |
+---------------+---------------+-------+-------+---------------+
| Nonce |
+-------------------------------+-------------------------------+
| Address (IPv4 - 4 bytes / IPv6 - 16 bytes) |
+-------------------------------+-------------------------------+
| Port (2 bytes, optional) | + MP_HMAC option
+-------------------------------+
Type=46 Length MP_OPT=7Each address has an Address ID that could be used for uniquely
identifying the address within a connection for address removal.
Each host maintains a list of unique Address IDs, and it manages these as it wishes. The
Address ID is also used to identify MP_
All Address IDs learned via either MP_
Possible scenarios in which this applies are the lack of resources to store a mapping or when IPv6 addresses are advertised even though the host only supports IPv4. Therefore, a host MUST treat address announcements as soft state. However, a sender MAY choose to update the announcements periodically to overcome temporary limitations.¶
A host MAY advertise private addresses, e.g., because there is a NAT on the path. It is desirable to allow this as there could be cases where both hosts have additional interfaces on the same private network. The advertisement of broadcast or multicast IP addresses MUST be ignored by the recipient of this option, as it is not permitted according to the unicast principle of the basic DCCP.¶
The MP_
Further security considerations around the issue of
MP_
The reception of an MP_
A host that receives an MP_
A host MAY send an MP_
3.2.9. MP_REMOVEADDR
If, during the lifetime of an MP-DCCP connection, a previously announced
address becomes invalid (e.g., if an interface disappears), the
affected host SHOULD announce this. The peer can remove a previously
added address with an Address ID from a connection
using the Remove Address
MP_
The Nonce is a 32-bit random value that is generated locally for
each MP_
Along with the MP_
The rationale for using an HMAC is to prevent unauthorized entities from
injecting MP_
A receiver MUST include an MP_
The reception of an MP_
The sending and receiving of this message SHOULD trigger the closing procedure described in [RFC4340] between the client and the server on the affected subflow(s), if possible. This helps remove middlebox state before removing any local state.¶
Address removal is done by the Address ID to allow the use of NATs and other middleboxes that rewrite source addresses. If there is no address at the requested Address ID, the receiver will silently ignore the request.¶
1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+---------------+---------------+---------------+---------------+
|0 0 1 0 1 1 1 0|0 0 0 0 0 1 0 0|0 0 0 0 1 0 0 0| Address ID |
+---------------+---------------+---------------+---------------+
| Nonce |
+-------------------------------+-------------------------------+
Type=46 Length=8 MP_OPT=8
-> followed by the MP_HMAC option
3.2.10. MP_PRIO
The path priority signaled with the MP_
The MP_
1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+---------------+---------------+---------------+---------------+
|0 0 1 0 1 1 1 0|0 0 0 0 0 1 0 0|0 0 0 0 1 0 0 1|(resvd)| prio |
+---------------+---------------+---------------+---------------+
Type=46 Length=4 MP_OPT=9The following values are available for the Prio field:¶
-
0: Do not use. The path is not available.¶
-
1: Standby: Do not use this path for traffic scheduling if another path (secondary or primary) is available. The path will only be used if other secondary or primary paths are not established.¶
-
2: Secondary: Do not use this path for traffic scheduling if the other paths are good enough. The path will be used occasionally for increasing the available capacity temporarily, e.g., when primary paths are congested or are not available. This is the recommended setting for paths that have costs or data caps as these paths will be used less frequently then primary paths.¶
-
3 - 15: Primary: The path can be used for packet scheduling decisions. The priority number indicates the relative priority of one path over the other for primary paths. Higher numbers indicate higher priority. The peer should consider sending traffic first over higher priority paths. This is the recommended setting for paths that do not have a cost or data caps associated with them as these paths will be frequently used.¶
Example use cases include:¶
-
Setting the Wi-Fi path to Primary and Cellular path to Secondary. In this case, Wi-Fi will be used and Cellular will be used only if the Wi-Fi path is congested or not available. Such setting results in using the Cellular path only temporally, if more capacity is needed than the Wi-Fi path can provide, indicating a clear priority of the Wi-Fi path over the Cellular due to, e.g., cost reasons.¶
-
Setting the Wi-Fi path to Primary and Cellular path to Standby. In this case, Wi-Fi will be used and Cellular will be used only if the Wi-Fi path is not available.¶
-
Setting the Wi-Fi path to Primary and Cellular path to Primary. In this case, both paths can be used when making packet scheduling decisions.¶
If not specified, the default behavior is to always use a path for
packet scheduling decisions
The relative ratio of the primary path values 3-15 depends on the path usage strategy, which is described in more detail in Section 3.11. In the case of path mobility (Section 3.11.1), only one path can be used at a time and MUST have the highest available priority value. That also includes the prio numbers 1 and 2. In the other case of concurrent path usage (Section 3.11.2), the definition is up to the multipath scheduler logic.¶
An MP_
3.2.11. MP_CLOSE
The mechanism available in DCCP [RFC4340] for closing a connection cannot give an indication for closing an MP-DCCP connection, which typically contains several DCCP subflows; therefore, one cannot conclude from the closing of a subflow to the closing of an MP-DCCP connection. This is solved by introducing MP_
1 2 3 01234567 89012345 67890123 45678901 23456789 +--------+--------+--------+--------+--------+ |00101110| var |00001010| Key Data ... +--------+--------+--------+--------+--------+ Type=46 Length MP_OPT=10
An MP-DCCP connection can be gracefully closed by sending an MP_
On reception of the first DCCP-CloseReq carrying an MP_
Upon reception of the first DCCP-Close carrying an MP_
When the MP-DCCP connection socket is in CLOSEREQ or CLOSED state, new subflow requests using MP_
Contrary to an MP_
3.2.12. Experimental Multipath Option MP_EXP for Private Use
This section reserves a Multipath Option to define and specify any experimental additional feature for improving and optimizing the MP-DCCP protocol. This
option could be applicable to specific environments or scenarios according to potential new requirements and is meant for private use only. MP_
1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+---------------+---------------+---------------+---------------+
|0 0 1 0 1 1 1 0| var |0 0 0 0 1 0 1 1| Data |
+---------------+---------------+---------------+---------------+
| ...
+---------------------------------------------------------------+
Type=46 Length MP_OPT=11The Data field can carry any data according to the foreseen use by the experimenters with a maximum Length of 252 bytes.¶
3.3. MP-DCCP Handshake Procedure
An example MP-DCCP handshake procedure is shown in Figure 21.¶
Host A Host B
------------------------ ----------
Address A1 Address A2 Address B1
---------- ---------- ----------
| | |
| DCCP-Request + Change R (MP_CAPABLE,...) |
|----- MP_KEY(CI-A + KeyA(1), KeyA(2),...) ---------->|
|<------------------- MP_KEY(CI-B + KeyB) ------------|
| DCCP-Response + Confirm L (MP_CAPABLE, ...) |
| | |
| DCCP-Ack | |
|---------------------------------------------------->|
|<----------------------------------------------------|
| DCCP-Ack | |
| | |
| |DCCP-Request + Change R(MP_CAPABLE,...)|
| |--- MP_JOIN(CI-B,RA) ----------------->|
| |<------MP_JOIN(CI-A,RB) + MP_HMAC(B)---|
| |DCCP-Response+Confirm L(MP_CAPABLE,...)|
| | |
| |DCCP-Ack |
| |-------- MP_HMAC(A) ------------------>|
| |<--------------------------------------|
| |DCCP-Ack |The basic initial handshake for the first subflow is as follows:¶
-
Host A sends a DCCP-Request with the Multipath Capable Feature change request and the MP_
KEY option with a Host-specific CI-A and a KeyA for each of the supported Key Types as described in Section 3.2.4. CI-A is a unique identifier during the lifetime of an MP-DCCP connection.¶ -
Host B sends a DCCP-Response with a Confirm feature for MP-Capable and the MP_
Key option with a unique Host-specific CI-B and a single Host-specific KeyB. The type of the key is chosen from the list of supported types from the previous request.¶ -
Host A sends a DCCP-Ack to confirm the proper key exchange.¶
-
Host B sends a DCCP-Ack to complete the handshake and set both connection ends to the OPEN state.¶
It should be noted that DCCP is protected against corruption of DCCP header data (Section 9 of [RFC4340]), so no additional mechanisms beyond the general confirmation are required to ensure that the header data has been properly received.¶
Host A waits for the final DCCP-Ack from Host B before starting any establishment of additional subflow connections.¶
The handshake for subsequent subflows, based on a successful initial handshake, is as follows:¶
-
Host A sends a DCCP-Request with the Multipath Capable Feature change request and the MP_
JOIN option with Host B's CI-B, obtained during the initial handshake. Additionally, a random Nonce RA is transmitted with the MP_ JOIN .¶ -
Host B computes the HMAC of the DCCP-Request and sends a DCCP-Response with a Confirm feature option for MP-Capable and the MP_
JOIN option with the CI-A and a random Nonce RB together with the computed MP_ HMAC . As specified in Section 3.2.6, the HMAC is calculated by taking the leftmost 20 bytes from the SHA-256 hash of an HMAC code that is created by using the Nonce received with MP_ JOIN (A ) and the local Nonce RB as the Message and the derived key as the Key, as described in Section 3.2.4:¶ MP_
HMAC (B ) = HMAC -SHA256 (Key =d -key B, Msg=RB+RA)¶ -
Host A sends a DCCP-Ack with the HMAC computed for the DCCP-Response. As specified in Section 3.2.6, the HMAC is calculated by taking the leftmost 20 bytes from the SHA-256 hash of an HMAC code created by using the local Nonce RA and the Nonce received with MP_
JOIN (B ) as message and the derived key described in Section 3.2.4 as key:¶ MP_
HMAC (A ) = HMAC -SHA256 (Key =d -key A, Msg=RA+RB)¶ -
Host B sends a DCCP-Ack to confirm the HMAC and to conclude the handshake.¶
3.4. Address Knowledge Exchange
3.4.1. Advertising a New Path (MP_ADDADDR)
When a host (Host A) wants to advertise the availability of a new path, it should use the MP_
-
an identifier (id 2) for the new IP address, which is used as a reference in subsequent control exchanges¶
-
a Nonce value to prevent replay attacks¶
-
the IP address of the new path
(A2_ IP )¶ -
a pair of bytes specifying the port number associated with this IP address. The value of 00 here indicates that the port number is the same as that used for the initial subflow address A1_
IP .¶
According to Section 3.2.8, the following options are required in a packet carrying MP_
-
the leftmost 20 bytes of the HMAC(A) generated during the initial handshake procedure described in Sections 3.3 and 3.2.6¶
-
the MP_
SEQ option with the sequence number (seqno 12) for this message, according to Section 3.2.5¶
Host B acknowledges receipt of the MP_
-
an MP_
CONFIRM containing the MP_ SEQ number (seqno 12) of the packet carrying the option that we are confirming together with the MP_ ADDADDR option¶ -
the leftmost 20 bytes of the HMAC(B) generated during the initial handshake procedure (Section 3.3)¶
Host A Host B
------------------------ -----------
Address A1 Address A2 Address B1
---------- ---------- -----------
| | |
| DCCP-Data + MP_ADDADDR(id 2, Nonce, A2_IP, 00) + |
|------- MP_HMAC(A) + MP_SEQ(seqno 12) -------------->|
| | |
| DCCP-Ack + MP_HMAC(B) + |
|<----- MP_CONFIRM(seqno 12, MP_ADDADDR) -------------|
3.4.2. Removing a Path (MP_REMOVEADDR)
When a host (Host A) wants to indicate that a path is no longer available, it should use the MP_
-
an identifier (id 2) for the IP address to remove
(A2_ IP ) and that was specified in a previous MP_ ADDADDR message¶ -
a Nonce value to prevent replay attacks¶
According to Section 3.2.9, the following options are required in a packet carrying MP_
-
the leftmost 20 bytes of the HMAC(A) generated during the initial handshake procedure described in Sections 3.3 and 3.2.6¶
-
the MP_
SEQ option with the sequence number (seqno 33) for this message, according to Section 3.2.5¶
Host B acknowledges receipt of the MP_
-
an MP_
CONFIRM containing the MP_ SEQ number (seqno 33) of the packet carrying the option that we are confirming, together with the MP_ REMOVEADDR option¶ -
the leftmost 20 bytes of the HMAC(B) generated during the initial handshake procedure (Section 3.3)¶
Host A Host B
------------------------ -----------
Address A1 Address A2 Address B1
---------- ---------- -----------
| | |
| DCCP-Data + MP_REMOVEADDR(id 2, Nonce) + |
|------- MP_HMAC(A) + MP_SEQ(seqno 33) -------------->|
| | |
| DCCP-Ack + MP_HMAC(B) + |
|<----- MP_CONFIRM(seqno 33, MP_REMOVEADDR) ----------|3.5. Closing an MP-DCCP Connection
When a host wants to close an existing subflow but not the whole MP-DCCP
connection, it MUST initiate the regular DCCP connection termination procedure
as described in Section 5.6 of [RFC4340], i.e., it sends a DCCP
A host terminates an MP-DCCP connection using the DCCP connection termination specified in
Section 5.5 of [RFC4340] on each subflow with the first packet on each subflow carrying MP_
Host A Host B
------ ------
<- Optional DCCP-CloseReq +
MP_CLOSE [A's key]
[on all subflows]
DCCP-Close + MP_CLOSE ->
[B's key] [on all subflows]
<- DCCP-Reset
[on all subflows]Additionally, an MP-DCCP connection may be closed abruptly using the "fast close"
procedure described in Section 3.2.3, where a DCCP-Reset is sent on all
subflows, each carrying the MP_
Host A Host B
------ ------
DCCP-Reset + MP_FAST_CLOSE ->
[B's key] [on all subflows]
<- DCCP-Reset
[on all subflows]3.6. Fallback
When a subflow fails to operate following the intended behavior of the MP-DCCP, it is
necessary to proceed with a fallback. This may be either falling back
to regular DCCP [RFC4340] or removing a problematic subflow. The main reasons for
a subflow failing include: no MP support at the peer host, failure to negotiate the protocol
version, loss of Multipath Options, faulty
At the start of an MP-DCCP connection, the handshake ensures the exchange of the MP-DCCP feature and options and thus ensures that the path is fully MP-DCCP capable. If during the handshake procedure it appears that DCCP-Request or DCCP-Response messages do not carry the Multipath Capable Feature, the MP-DCCP connection will not be established and the handshake SHOULD fall back to regular DCCP. If this is not possible, the connection MUST be closed.¶
If the endpoints fail to agree on the protocol version to use during the Multipath Capable Feature negotiation, the connection MUST either be closed or fall back to regular DCCP. This is described in Section 3.1. The protocol version negotiation distinguishes between negotiation for the initial connection establishment and the addition of subsequent subflows. If protocol version negotiation is not successful during the initial connection establishment, the MP-DCCP connection will fall back to regular DCCP.¶
The fallback procedure for regular DCCP MUST also be applied if the MP_
If a subflow attempts to join an existing MP-DCCP connection but MP-DCCP options or the Multipath Capable Feature are not present or are faulty in the handshake procedure, that subflow MUST be closed.
This is the case especially if a different MP_
The subflow closing procedure MUST also be applied if a final ACK carrying MP_
Another relevant case is when payload data is modified by middleboxes. DCCP uses a checksum to protect the data, as described in Section 9 of [RFC4340]. A checksum will fail if the data has been changed in any way. All data from the start of the segment that failed the checksum onwards cannot be considered trustworthy. As defined by DCCP, if the checksum fails, the receiving endpoint MUST drop the application data and report that data as dropped due to corruption using a Data Dropped option (Drop Code 3, Corrupt). If data is dropped due to corruption for an MP-DCCP connection, the affected subflow MAY be closed. The same procedure applies if the Multipath Option is unknown.¶
3.7. State Diagram
The MP-DCCP per subflow state transitions follow the state transitions defined for DCCP in [RFC4340] to a large extent, with some modifications due to the MP-DCCP 4-way handshake and fast close procedures. The state diagram below shows the most common state transitions. The diagram is illustrative. For example, there are arcs (not shown) from several additional states to TIMEWAIT, contingent on the receipt of a valid DCCP-Reset.¶
When the state moves from CLOSED to OPEN during the 4-way handshake, the transitioned states remain the same as for DCCP, but it is no longer possible to transmit application data while in the REQUEST state. The fast close procedure can be triggered by either the client or the server and results in the transmission of a Reset packet. The fast close procedure moves the state of the Client and Server directly to TIMEWAIT and CLOSED, respectively.¶
+----------------------------+ +------------------------------+
| v v |
| +----------+ |
| +-------------+ CLOSED +-------------+ |
| | passive +----------+ active | |
| | open open | |
| | snd Request | |
| v v |
| +-----------+ +----------+ |
| | LISTEN | | REQUEST | |
| +-----+-----+ +----+-----+ |
| | rcv Request rcv Response | |
| | snd Response snd Ack | |
| v v |
| +-----------+ +----------+ |
| | RESPOND | | PARTOPEN | |
| +-----+-----+ +----+-----+ |
| | rcv Ack rcv Ack/DataAck | |
| | snd Ack | |
| | +-----------+ | |
| +------------>| OPEN |<-----------+ |
| +--+-+-+-+--+ |
| server active close | | | | active close |
| snd CloseReq | | | | or rcv CloseReq |
| | | | | snd Close |
| | | | | |
| +-----------+ | | | | +----------+ |
| | CLOSEREQ |<---------+ | | +----------->| CLOSING | |
| +-----+-----+ | | +----+-----+ |
| | rcv Close | | rcv Reset | |
| | snd Reset | | | |
| | | | active FastClose | |
|<----------+ rcv Close | | or rcv FastClose v |
| or server active FastClose | | snd Reset +----+-----+ |
| or server rcv FastClose | +------------->| TIMEWAIT | |
| snd Reset | +----+-----+ |
+------------------------------+ | |
+-----------+
2MSL timer expires3.8. Congestion Control Considerations
Senders MUST manage per-path congestion status and avoid sending more data on a given path than congestion control allows for each path.¶
3.9. Maximum Packet Size Considerations
A DCCP implementation maintains the maximum packet size (MPS) during operation of a DCCP session. This procedure is specified for single-path DCCP in Section 14 of [RFC4340]. Without any restrictions, this is adopted for MP-DCCP operations, in particular the Path MTU (PMTU) measurement and the Sender Behavior. The DCCP application interface SHOULD allow the application to discover the current MPS. This reflects the current largest size supported for the data stream that can be used across the set of all active MP-DCCP subflows.¶
3.10. Maximum Number of Subflow Considerations
MP-DCCP does not support any explicit procedure to negotiate the maximum number of subflows between endpoints. However, in practical scenarios, there will be resource limitations on the host or use cases that do not benefit from additional subflows.¶
It is RECOMMENDED to limit the number of subflows in implementations and to reject incoming subflow requests with a DCCP-Reset using the Reset Code "too busy" according to [RFC4340] if the resource limit is exceeded or it is known that the multipath connection will not benefit from further subflows. Likewise, it is RECOMMENDED that the host that wants to create the subflows considers the available resources and possible gains.¶
To avoid further inefficiencies with subflows due to short-lived connections, it MAY be useful to delay the start of additional subflows. The decision on the initial number of subflows can be based on the occupancy of the socket buffer and/or the timing.¶
While in the socket
3.11. Path Usage Strategies
MP-DCCP can be configured to realize one of several strategies for path usage via selecting one DCCP subflow out of the multiple DCCP subflows within an MP-DCCP connection for data transmission. This can be a dynamic process further facilitated by the means of DCCP and MP-DCCP-defined options such as path preference using MP-PRIO; adding or removing DCCP subflows using MP_
3.11.1. Path Mobility
The path mobility strategy provides the use of a single path with a seamless handover function to continue the connection when the currently used path is deemed unsuitable for service delivery.
Some of the DCCP subflows of an MP-DCCP connection might become inactive due to either the occurrence of certain error conditions (e.g., DCCP timeout, packet loss threshold, RTT threshold, and closed/removed) or adjustments from the MP-DCCP user.
When there is outbound data to send and the primary path becomes inactive (e.g., due to failures) or deprioritized, the MP-DCCP endpoint SHOULD try to send the data through an alternate path with a different source or destination address (depending on the point of failure), if one exists. This process SHOULD respect the path priority configured by the MP_
3.11.2. Concurrent Path Usage
Different from a path mobility strategy, the selection between MP-DCCP subflows is a per-packet decision that is a part of the multipath scheduling process. This method would allow multiple subflows to be simultaneously used to aggregate the path resources to obtain higher connection throughput.¶
In this scenario, the selection of congestion control, per-packet scheduling, and a potential reordering method determines a concurrent path utilization strategy and result in a particular transport characteristic. A concurrent path usage method uses a scheduling design that could seek to maximize reliability, maximize throughput, minimize latency, etc.¶
Concurrent path usage over the Internet can have implications. When an MP-DCCP connection uses two or more paths, there is no guarantee that these paths are fully disjoint. When two (or more) subflows share the same bottleneck, using a standard congestion control algorithm could result in an unfair distribution of the capacity with the multipath connection using more capacity than competing single-path connections.¶
Multipath TCP uses the coupled congestion control Linked Increases Algorithm (LIA) specified in an experimental specification [RFC6356] to solve this problem. This scheme could also be specified for MP-DCCP. The same applies to other coupled congestion control algorithms that have been proposed for Multipath TCP such as the Opportunistic Linked Increases Algorithm [OLIA].¶
The specification of scheduling for concurrent multipath and related
congestion control algorithms and reordering methods for use in the general
Internet are outside the scope of this document. If, and when, the IETF
specifies a method for concurrent usage of multiple paths for the
general Internet, the framework specified in this document could be used to
provide an IETF
4. Security Considerations
Similar to DCCP, MP-DCCP does not provide cryptographic security
guarantees inherently. Thus, if applications need cryptographic security
(integrity, authentication, confidentiality
DCCP [RFC4340] provides protection against hijacking
and limits the potential impact of some denial
-
Provide assurance that the parties involved in an MP-DCCP handshake procedure are identical to those in the original DCCP connection.¶
-
Before a path is used, verify that the new advertised path is valid for receiving traffic.¶
-
Provide replay protection, i.e., ensure that a request to add/remove a subflow is 'fresh'.¶
-
Allow a party to limit the number of subflows that it allows.¶
To achieve these goals, MP-DCCP includes a hash-based handshake algorithm documented in Sections 3.2.4, 3.2.6, and 3.3. The security of the MP-DCCP connection depends on the use of keys that are shared once at the start of the first subflow and are never sent again over the network. Depending on the security requirements, different Key Types can be negotiated in the handshake procedure or must follow the fallback scenario described in Section 3.6. If there are security requirements that go beyond the capabilities of Key Type 0, then it is RECOMMENDED that Key Type 0 not be enabled to avoid downgrade attacks that result in the key being exchanged as plain text. To ease demultiplexing while not revealing cryptographic material, subsequent subflows use the initially exchanged CI information. The keys exchanged once at the beginning are concatenated and used as keys for creating HMACs used on subflow setup, in order to verify that the parties in the handshake of subsequent subflows are the same as in the original connection setup. This also provides verification that the peer can receive traffic at this new address. Replay attacks would still be possible when only keys are used; therefore, the handshakes use single-use random numbers (Nonces) for both parties -- this ensures that the HMAC will never be the same on two handshakes. Guidance on generating random numbers suitable for use as keys is given in [RFC4086]. During normal operation, regular DCCP protection mechanisms (such as the header checksum to protect DCCP headers against corruption) is designed to provide the same level of protection against attacks on individual DCCP subflows as exists for regular DCCP.¶
As discussed in Section 3.2.8, a host may advertise its private
addresses, but these might point to different hosts in the receiver's
network. The MP_
As described in Section 3.9, an MPS is maintained for an MP-DCCP connection. If MP-DCCP exposes a minimum MPS across all paths, any change to one path impacts the sender for all paths. To mitigate attacks that seek to force a low MPS, MP-DCCP could detect an attempt to reduce the MPS to less than a minimum MPS and then stop using these paths.¶
5. Interactions with Middleboxes
Issues from interaction with on-path middleboxes such as NATs, firewalls, proxies,
IDSs, and others have to be considered for all
extensions to standard protocols; otherwise, unexpected reactions of
middleboxes may hinder its deployment. DCCP already provides means to
mitigate the potential impact of middleboxes, in comparison to TCP (see
Section 16 of [RFC4340]). When both hosts are located behind a NAT or
firewall entity, specific measures have to be applied such as the
simultaneous
[RFC6773] specifies UDP encapsulation for NAT traversal of DCCP sessions, similar to other UDP encapsulations such as the Stream Control Transmission Protocol (SCTP) [RFC6951]. Future specifications by the IETF could specify other methods for DCCP encapsulation.¶
The security impact of MP-DCCP-aware middleboxes is discussed in Section 4.¶
6. Implementation
The approach described above has been implemented in open source across different testbeds, and a new scheduling algorithm has been extensively tested. Also, demonstrations of a laboratory setup have been executed and published; see [MP-DCCP.Site].¶
7. IANA Considerations
This section provides guidance to the Internet Assigned Numbers Authority (IANA) regarding the registration of values related to the MP extension of the DCCP protocol in accordance with the RFC Required policy in Section 4.7 of [RFC8126]. This document defines one new value that has been allocated in the IANA "DCCP Feature Numbers" registry and creates three new registries that have been added in the "Datagram Congestion Control Protocol (DCCP) Parameters" registry group.¶
7.1. New Multipath Capable DCCP Feature
Per this document, IANA has assigned a new DCCP feature parameter for negotiating the support of multipath capability for DCCP sessions between hosts as described in Section 3. The following entry in Table 6 has been added to the "Feature Numbers" registry in the DCCP registry group according to Section 19.4 of [RFC4340].¶
| Number | Description |
Reference |
|---|---|---|
| 10 | Multipath Capable | RFC 9897 |
7.2. New MP-DCCP Versions Registry
Section 3.1 specifies the new 1-byte entry above that includes a 4-bit part to specify the version of the used MP-DCCP implementation. IANA has created a new "MP-DCCP Versions" registry in the DCCP registry group to track the MP-DCCP version. The initial content of this registry is as follows:¶
| Version | Value | Reference |
|---|---|---|
| 0 | 0000 | RFC 9897 |
| 1-15 | Unassigned |
Future MP-DCCP versions 1 to 15 will be assigned from this registry using the RFC Required policy (Section 4.7 of [RFC8126]).¶
7.3. New Multipath Option Type and Registry
IANA has assigned value 46 in the DCCP "Option Types" registry, as described in Section 3.2.¶
IANA has created a new "Multipath Options" registry within the DCCP registry group. The following entries in Table 8 have been added to the new "Multipath Options" registry. The registry has an upper boundary of 255 in the numeric value field.¶
| Multipath Option | Name | Description | Reference |
|---|---|---|---|
| MP_ |
MP_ |
Confirm reception |
Section 3.2.1 |
| MP_ |
MP_ |
Join subflow to an existing MP-DCCP connection | Section 3.2.2 |
| MP_ |
MP_ |
Close an MP-DCCP connection unconditionally | Section 3.2.3 |
| MP_ |
MP_ |
Exchange key material for MP_ |
Section 3.2.4 |
| MP_ |
MP_ |
Multipath sequence number | Section 3.2.5 |
| MP_ |
MP_ |
Hash-based message authentication code for MP-DCCP | Section 3.2.6 |
| MP_ |
MP_ |
Transmit RTT values and calculation parameters | Section 3.2.7 |
| MP_ |
MP_ |
Advertise one or more additional addresses/ports | Section 3.2.8 |
| MP_ |
MP_ |
Remove one or more addresses/ports | Section 3.2.9 |
| MP_ |
MP_ |
Change subflow priority | Section 3.2.10 |
| MP_ |
MP_ |
Close an MP-DCCP connection | Section 3.2.11 |
| MP_ |
MP_ |
Experimental option for private use | Section 3.2.12 |
| MP_ |
Unassigned |
Future Multipath Options with MP_
7.4. New DCCP-Reset Code
IANA has assigned a new DCCP-Reset Code, value 13, in the "Reset Codes" registry, with the description "Abrupt MP termination". Use of this Reset Code is defined in Section 3.2.3.¶
7.5. New Multipath Key Type Registry
IANA has created a new "Multipath Key Type" registry for this version of the MP-DCCP protocol that contains two different suboptions to the MP_
| Type | Name | Meaning | Reference |
|---|---|---|---|
| 0 | Plain Text | Plain text Key | Section 3.2.4 |
| 1-254 | Unassigned | ||
| 255 | Experimental | For private use only | Section 3.2.4 |
8. References
8.1. Normative References
- [DCCP
-PARAMETERS] -
IANA, "Datagram Congestion Control Protocol (DCCP) Parameters", <https://
www >..iana .org /assignments /dccp -parameters - [RFC2119]
-
Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10
.17487 , , <https:///RFC2119 www >..rfc -editor .org /info /rfc2119 - [RFC4086]
-
Eastlake 3rd, D., Schiller, J., and S. Crocker, "Randomness Requirements for Security", BCP 106, RFC 4086, DOI 10
.17487 , , <https:///RFC4086 www >..rfc -editor .org /info /rfc4086 - [RFC4340]
-
Kohler, E., Handley, M., and S. Floyd, "Datagram Congestion Control Protocol (DCCP)", RFC 4340, DOI 10
.17487 , , <https:///RFC4340 www >..rfc -editor .org /info /rfc4340 - [RFC6234]
-
Eastlake 3rd, D. and T. Hansen, "US Secure Hash Algorithms (SHA and SHA-based HMAC and HKDF)", RFC 6234, DOI 10
.17487 , , <https:///RFC6234 www >..rfc -editor .org /info /rfc6234 - [RFC8126]
-
Cotton, M., Leiba, B., and T. Narten, "Guidelines for Writing an IANA Considerations Section in RFCs", BCP 26, RFC 8126, DOI 10
.17487 , , <https:///RFC8126 www >..rfc -editor .org /info /rfc8126 - [RFC8174]
-
Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words", BCP 14, RFC 8174, DOI 10
.17487 , , <https:///RFC8174 www >..rfc -editor .org /info /rfc8174
8.2. Informative References
- [IETF105.Slides]
-
Amend, M., "MP-DCCP for enabling transfer of UDP/IP traffic over multiple data paths in multi
-connectivity networks" , IETF 105 Proceedings, , <https://datatracker >..ietf .org /meeting /105 /materials /slides -105 -tsvwg -sessa -62 -dccp -extensions -for -multipath -operation -00 - [MP-DCCP.Paper]
-
Amend, M., Bogenfeld, E., Cvjetkovic, M., Rakocevic, V., Pieska, M., Kassler, A., and A. Brunstrom, "A Framework for Multiaccess Support for Unreliable Internet Traffic using Multipath DCCP", 2019 IEEE 44th Conference on Local Computer Networks (LCN), pp. 316-323, DOI 10
.1109 , , <https:///LCN44214 .2019 .8990746 doi >..org /10 .1109 /LCN44214 .2019 .8990746 - [MP-DCCP.Site]
-
"Multipath extension for DCCP", <https://
multipath >.-dccp .org / - [MULTIPATH
-REORDERING] -
Amend, M. and D. Von Hugo, "Multipath sequence maintenance", Work in Progress, Internet-Draft, draft
-amend , , <https://-iccrg -multipath -reordering -03 datatracker >..ietf .org /doc /html /draft -amend -iccrg -multipath -reordering -03 - [OLIA]
-
Khalili, R., Gast, N., Popovic, M., Upadhyay, U., and J. Le Boudec, "MPTCP is not pareto-optimal: performance issues and a possible solution", CoNEXT '12: Proceedings of the 8th international
conference on Emerging networking experiments and
technologies, pp. 1-12, DOI 10
.1145 , , <https:///2413176 .2413178 dl >..acm .org /doi /10 .1145 /2413176 .2413178 - [RFC2104]
-
Krawczyk, H., Bellare, M., and R. Canetti, "HMAC: Keyed-Hashing for Message Authentication", RFC 2104, DOI 10
.17487 , , <https:///RFC2104 www >..rfc -editor .org /info /rfc2104 - [RFC3711]
-
Baugher, M., McGrew, D., Naslund, M., Carrara, E., and K. Norrman, "The Secure Real-time Transport Protocol (SRTP)", RFC 3711, DOI 10
.17487 , , <https:///RFC3711 www >..rfc -editor .org /info /rfc3711 - [RFC5238]
-
Phelan, T., "Datagram Transport Layer Security (DTLS) over the Datagram Congestion Control Protocol (DCCP)", RFC 5238, DOI 10
.17487 , , <https:///RFC5238 www >..rfc -editor .org /info /rfc5238 - [RFC5596]
-
Fairhurst, G., "Datagram Congestion Control Protocol (DCCP) Simultaneous
-Open Technique to Facilitate NAT/Middlebox Traversal" , RFC 5596, DOI 10.17487 , , <https:///RFC5596 www >..rfc -editor .org /info /rfc5596 - [RFC5597]
-
Denis-Courmont, R., "Network Address Translation (NAT) Behavioral Requirements for the Datagram Congestion Control Protocol", BCP 150, RFC 5597, DOI 10
.17487 , , <https:///RFC5597 www >..rfc -editor .org /info /rfc5597 - [RFC6356]
-
Raiciu, C., Handley, M., and D. Wischik, "Coupled Congestion Control for Multipath Transport Protocols", RFC 6356, DOI 10
.17487 , , <https:///RFC6356 www >..rfc -editor .org /info /rfc6356 - [RFC6773]
-
Phelan, T., Fairhurst, G., and C. Perkins, "DCCP-UDP: A Datagram Congestion Control Protocol UDP Encapsulation for NAT Traversal", RFC 6773, DOI 10
.17487 , , <https:///RFC6773 www >..rfc -editor .org /info /rfc6773 - [RFC6904]
-
Lennox, J., "Encryption of Header Extensions in the Secure Real-time Transport Protocol (SRTP)", RFC 6904, DOI 10
.17487 , , <https:///RFC6904 www >..rfc -editor .org /info /rfc6904 - [RFC6951]
-
Tuexen, M. and R. Stewart, "UDP Encapsulation of Stream Control Transmission Protocol (SCTP) Packets for End-Host to End-Host Communication", RFC 6951, DOI 10
.17487 , , <https:///RFC6951 www >..rfc -editor .org /info /rfc6951 - [RFC7323]
-
Borman, D., Braden, B., Jacobson, V., and R. Scheffenegger, Ed., "TCP Extensions for High Performance", RFC 7323, DOI 10
.17487 , , <https:///RFC7323 www >..rfc -editor .org /info /rfc7323 - [RFC8041]
-
Bonaventure, O., Paasch, C., and G. Detal, "Use Cases and Operational Experience with Multipath TCP", RFC 8041, DOI 10
.17487 , , <https:///RFC8041 www >..rfc -editor .org /info /rfc8041 - [RFC8684]
-
Ford, A., Raiciu, C., Handley, M., Bonaventure, O., and C. Paasch, "TCP Extensions for Multipath Operation with Multiple Addresses", RFC 8684, DOI 10
.17487 , , <https:///RFC8684 www >..rfc -editor .org /info /rfc8684 - [RFC9293]
-
Eddy, W., Ed., "Transmission Control Protocol (TCP)", STD 7, RFC 9293, DOI 10
.17487 , , <https:///RFC9293 www >..rfc -editor .org /info /rfc9293 - [TS23.501]
-
3GPP, "System architecture for the 5G System; Stage 2; Release 16", Version 16.7.0, Release 16, , <https://
www >..3gpp .org /ftp //Specs /archive /23_ series /23 .501 /23501 -g70 .zip - [U-DCCP]
-
Amend, M., Brunstrom, A., Kassler, A., and V. Rakocevic, "Lossless and overhead free DCCP - UDP header conversion (U-DCCP)", Work in Progress, Internet-Draft, draft
-amend , , <https://-tsvwg -dccp -udp -header -conversion -01 datatracker >..ietf .org /doc /html /draft -amend -tsvwg -dccp -udp -header -conversion -01
Appendix A. Differences from Multipath TCP
This appendix is informative.¶
MP-DCCP is similar to Multipath TCP [RFC8684] in that it extends the related basic DCCP transport protocol [RFC4340] with multipath capabilities in the same way as Multipath TCP extends TCP [RFC9293]. However, because of the differences between the underlying TCP and DCCP protocols, the transport characteristics of MPTCP and MP-DCCP are different.¶
Table 10 compares the protocol characteristics of TCP
and DCCP, which are by nature inherited by their respective multipath
extensions. A major difference lies in the delivery of the payload, which
for TCP is an exact copy of the generated byte stream. DCCP behaves
differently and does not guarantee the delivery of any payload nor the
order of delivery.
Since this is mainly affecting the receiving endpoint of a TCP or
DCCP communication, many similarities on the sender side can be identified.
Both transport protocols share the 3-way initiation of a
communication and both employ congestion control to adapt the sending
rate to the path characteristics
| Feature | TCP | DCCP |
|---|---|---|
| Full-Duplex | yes | yes |
| Connection |
yes | yes |
| Header option space | 40 bytes | < 1008 bytes or PMTU |
| Data transfer | reliable | unreliable |
| Packet-loss handling | retransmission | report only |
| Ordered data delivery | yes | no |
| Sequence numbers | one per byte | one per PDU |
| Flow control | yes | no |
| Congestion control | yes | yes |
| ECN support | yes | yes |
| Selective ACK | yes | depends on congestion control |
| Fix message boundaries | no | yes |
| Path MTU discovery | yes | yes |
| Fragmentation | yes | no |
| SYN flood protection | yes | no |
| Half-open connections | yes | no |
Consequently, the multipath characteristics shown in Table 11 are the same, supporting volatile paths that have varying capacities and latency, session handovers, and path aggregation capabilities. All of these features profit by the existence of congestion control.¶
| Feature | MPTCP | MP-DCCP |
|---|---|---|
| Volatile paths | yes | yes |
| Session handover | yes | yes |
| Path aggregation | yes | yes |
| Data reordering | yes | optional |
| Expandability | limited by TCP header | flexible |
Therefore, the sender logic is not much different between MP-DCCP and MPTCP.¶
The receiver side for MP-DCCP has to deal with the unreliable delivery provided by
DCCP. The multipath sequence numbers included in MP-DCCP (see Section 3.2.5) facilitates
adding optional mechanisms for data stream packet reordering
at the receiver. Information from the MP_
In contrast to TCP, the receiver processing for MPTCP adopted a rigid "just wait" approach, because TCP guarantees reliable in-order delivery.¶
Acknowledgments
[RFC8684] defines Multipath TCP and provides important inputs for this specification.¶
The authors gratefully acknowledge significant input into this document from Dirk von Hugo, Nathalie Romo Moreno, Omar Nassef, Mohamed Boucadair, Simone Ferlin, Olivier Bonaventure, Gorry Fairhurst, and Behcet Sarikaya.¶