QUIC: A UDP-Based Multiplexed and Secure Transport
draft-hamilton-quic-transport-protocol-01
Document | Type |
Replaced Internet-Draft
(candidate for quic WG)
Expired & archived
|
|
---|---|---|---|
Authors | Ryan Hamilton , Jana Iyengar , Ian Swett , Alyssa Wilk | ||
Last updated | 2016-11-23 (Latest revision 2016-10-31) | ||
Replaced by | draft-ietf-quic-transport | ||
RFC stream | Internet Engineering Task Force (IETF) | ||
Intended RFC status | (None) | ||
Formats | |||
Additional resources | Mailing list discussion | ||
Stream | WG state | Call For Adoption By WG Issued | |
Document shepherd | (None) | ||
IESG | IESG state | Replaced by draft-ietf-quic-transport | |
Consensus boilerplate | Unknown | ||
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
QUIC is a multiplexed and secure transport protocol that runs on top of UDP. QUIC builds on past transport experience, and implements mechanisms that make it useful as a modern general-purpose transport protocol. Using UDP as the basis of QUIC is intended to address compatibility issues with legacy clients and middleboxes. QUIC authenticates all of its headers, preventing third parties from from changing them. QUIC encrypts most of its headers, thereby limiting protocol evolution to QUIC endpoints only. Therefore, middleboxes, in large part, are not required to be updated as new protocol versions are deployed. This document describes the core QUIC protocol, including the conceptual design, wire format, and mechanisms of the QUIC protocol for connection establishment, stream multiplexing, stream and connection-level flow control, and data reliability. Accompanying documents describe QUIC's loss recovery and congestion control, and the use of TLS 1.3 for key negotiation.
Authors
Ryan Hamilton
Jana Iyengar
Ian Swett
Alyssa Wilk
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)