Multipath Extension for QUIC
draft-deconinck-quic-multipath-00
The information below is for an old version of the document |
Document |
Type |
|
Active Internet-Draft (individual)
|
|
Authors |
|
Quentin De Coninck
,
Olivier Bonaventure
|
|
Last updated |
|
2018-03-05
|
|
Stream |
|
(None)
|
|
Intended RFC status |
|
(None)
|
|
Formats |
|
pdf
htmlized (tools)
htmlized
bibtex
|
Stream |
Stream state |
|
(No stream defined) |
|
Consensus Boilerplate |
|
Unknown
|
|
RFC Editor Note |
|
(None)
|
IESG |
IESG state |
|
I-D Exists
|
|
Telechat date |
|
|
|
Responsible AD |
|
(None)
|
|
Send notices to |
|
(None)
|
QUIC Working Group Q. De Coninck
Internet-Draft O. Bonaventure
Intended status: Standards Track UCLouvain
Expires: September 6, 2018 March 5, 2018
Multipath Extension for QUIC
draft-deconinck-quic-multipath-00
Abstract
This document proposes extensions to the QUIC protocol to enable the
usage of multiple paths over a single connection. Those changes
remain compliant with the current single-path QUIC design. They
allow devices to benefit from multiple network paths while preserving
the privacy features of QUIC.
Status of This Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
This Internet-Draft will expire on September 6, 2018.
Copyright Notice
Copyright (c) 2018 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
(http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
De Coninck & BonaventureExpires September 6, 2018 [Page 1]
Internet-Draft MP-QUIC March 2018
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3
2. Conventions and Definitions . . . . . . . . . . . . . . . . . 3
2.1. Notational Conventions . . . . . . . . . . . . . . . . . 4
3. Overview . . . . . . . . . . . . . . . . . . . . . . . . . . 4
3.1. What is a Path? . . . . . . . . . . . . . . . . . . . . . 4
3.2. Beyond Connection Migration . . . . . . . . . . . . . . . 5
3.3. Establishment of a Multipath QUIC Connection . . . . . . 6
3.4. Architecture of Multipath QUIC . . . . . . . . . . . . . 7
3.5. Path Establishment . . . . . . . . . . . . . . . . . . . 7
3.6. Exchanging Data over Multiple Paths . . . . . . . . . . . 8
3.7. Exchanging Addresses . . . . . . . . . . . . . . . . . . 9
3.8. Coping with Address Removals . . . . . . . . . . . . . . 10
3.9. Path Migration . . . . . . . . . . . . . . . . . . . . . 10
3.10. Congestion Control . . . . . . . . . . . . . . . . . . . 11
4. Mapping Path ID to Connection ID . . . . . . . . . . . . . . 11
5. Using Multiple Paths . . . . . . . . . . . . . . . . . . . . 12
5.1. Multipath Negotiation . . . . . . . . . . . . . . . . . . 12
5.1.1. Transport Parameter Definition . . . . . . . . . . . 13
5.2. Variable-Length Encoding of the Path ID . . . . . . . . . 13
5.3. Coping with Additional Remote Addresses . . . . . . . . . 13
5.4. Path State . . . . . . . . . . . . . . . . . . . . . . . 14
5.5. Dynamic Management of Paths . . . . . . . . . . . . . . . 16
5.6. Loosing Addresses . . . . . . . . . . . . . . . . . . . . 17
5.7. Scheduling Strategies . . . . . . . . . . . . . . . . . . 17
6. Modifications to QUIC frames . . . . . . . . . . . . . . . . 18
6.1. NEW_CONNECTION_ID Frame . . . . . . . . . . . . . . . . . 18
6.2. ACK Frame . . . . . . . . . . . . . . . . . . . . . . . . 20
7. New Frames . . . . . . . . . . . . . . . . . . . . . . . . . 20
7.1. MAX_PATHS Frame . . . . . . . . . . . . . . . . . . . . . 20
7.2. PATH_UPDATE Frame . . . . . . . . . . . . . . . . . . . . 21
7.3. ADD_ADDRESS Frame . . . . . . . . . . . . . . . . . . . . 22
7.4. REMOVE_ADDRESS Frame . . . . . . . . . . . . . . . . . . 23
7.5. PATHS Frame . . . . . . . . . . . . . . . . . . . . . . . 23
8. Security Considerations . . . . . . . . . . . . . . . . . . . 25
8.1. Nonce Computation . . . . . . . . . . . . . . . . . . . . 25
8.2. Validation of Exchanged Addresses . . . . . . . . . . . . 25
9. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 26
Show full document text