idnits 2.17.1 draft-pardue-quic-siduck-00.txt: Checking boilerplate required by RFC 5378 and the IETF Trust (see https://trustee.ietf.org/license-info): ---------------------------------------------------------------------------- No issues found here. Checking nits according to https://www.ietf.org/id-info/1id-guidelines.txt: ---------------------------------------------------------------------------- No issues found here. Checking nits according to https://www.ietf.org/id-info/checklist : ---------------------------------------------------------------------------- ** The abstract seems to contain references ([2], [1]), which it shouldn't. Please replace those with straight textual mentions of the documents in question. Miscellaneous warnings: ---------------------------------------------------------------------------- == The copyright year in the IETF Trust and authors Copyright Line does not match the current year -- The document date (November 18, 2019) is 1621 days in the past. Is this intentional? Checking references for intended status: Experimental ---------------------------------------------------------------------------- -- Looks like a reference, but probably isn't: '1' on line 236 -- Looks like a reference, but probably isn't: '2' on line 238 == Outdated reference: A later version (-34) exists of draft-ietf-quic-transport-23 == Outdated reference: A later version (-05) exists of draft-pauly-quic-datagram-04 ** Obsolete normative reference: RFC 7230 (Obsoleted by RFC 9110, RFC 9112) == Outdated reference: A later version (-19) exists of draft-ietf-httpbis-header-structure-14 == Outdated reference: A later version (-34) exists of draft-ietf-quic-http-23 == Outdated reference: A later version (-05) exists of draft-schinazi-quic-h3-datagram-01 -- Obsolete informational reference (is this intentional?): RFC 7540 (Obsoleted by RFC 9113) Summary: 2 errors (**), 0 flaws (~~), 6 warnings (==), 4 comments (--). Run idnits with the --verbose option for more detailed information about the items above. -------------------------------------------------------------------------------- 2 QUIC L. Pardue 3 Internet-Draft November 18, 2019 4 Intended status: Experimental 5 Expires: May 21, 2020 7 Simple Datagram Usability and Connectivity Kata 8 draft-pardue-quic-siduck-00 10 Abstract 12 This document describes a simple application protocol for testing 13 implementations of the QUIC DATAGRAM frame. SiDUCK (Simple Datagram 14 Usability and Connectivity Kata) defines a new ALPN ID, "siduck-00", 15 along with a basic offer and acknowledgement interaction using 16 datagram payload data. 18 Note to Readers 20 Discussion of this document takes place on the QUIC Working Group 21 mailing list (quic@ietf.org), which is archived at 22 https://mailarchive.ietf.org/arch/browse/quic/ [1]. 24 Source for this draft and an issue tracker can be found at 25 https://github.com/lpardue/draft-pardue-quic-siduck [2]. 27 Status of This Memo 29 This Internet-Draft is submitted in full conformance with the 30 provisions of BCP 78 and BCP 79. 32 Internet-Drafts are working documents of the Internet Engineering 33 Task Force (IETF). Note that other groups may also distribute 34 working documents as Internet-Drafts. The list of current Internet- 35 Drafts is at https://datatracker.ietf.org/drafts/current/. 37 Internet-Drafts are draft documents valid for a maximum of six months 38 and may be updated, replaced, or obsoleted by other documents at any 39 time. It is inappropriate to use Internet-Drafts as reference 40 material or to cite them other than as "work in progress." 42 This Internet-Draft will expire on May 21, 2020. 44 Copyright Notice 46 Copyright (c) 2019 IETF Trust and the persons identified as the 47 document authors. All rights reserved. 49 This document is subject to BCP 78 and the IETF Trust's Legal 50 Provisions Relating to IETF Documents 51 (https://trustee.ietf.org/license-info) in effect on the date of 52 publication of this document. Please review these documents 53 carefully, as they describe your rights and restrictions with respect 54 to this document. Code Components extracted from this document must 55 include Simplified BSD License text as described in Section 4.e of 56 the Trust Legal Provisions and are provided without warranty as 57 described in the Simplified BSD License. 59 Table of Contents 61 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 62 1.1. Notational Conventions . . . . . . . . . . . . . . . . . 3 63 2. Negotiating SiDUCK . . . . . . . . . . . . . . . . . . . . . 3 64 3. Protocol Behaviour . . . . . . . . . . . . . . . . . . . . . 4 65 4. The SIDUCK_ONLY_QUACKS_ECHO error code . . . . . . . . . . . 4 66 5. Known Issues / Problems . . . . . . . . . . . . . . . . . . . 4 67 6. Security Considerations . . . . . . . . . . . . . . . . . . . 4 68 7. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 4 69 8. References . . . . . . . . . . . . . . . . . . . . . . . . . 4 70 8.1. Normative References . . . . . . . . . . . . . . . . . . 4 71 8.2. Informative References . . . . . . . . . . . . . . . . . 5 72 8.3. URIs . . . . . . . . . . . . . . . . . . . . . . . . . . 5 73 Appendix A. Acknowledgements . . . . . . . . . . . . . . . . . . 6 74 Author's Address . . . . . . . . . . . . . . . . . . . . . . . . 6 76 1. Introduction 78 The DATAGRAM frame [I-D.pauly-quic-datagram] for QUIC 79 [I-D.ietf-quic-transport] is an extension for the unreliable delivery 80 of datagrams. Applications using DATAGRAM negotiate it using 81 Transport Parameters but the application-specific contents are left 82 for a higher-level mechanism. 84 HTTP/3 DATAGRAM [I-D.schinazi-quic-h3-datagram] defines the usage of 85 QUIC DATAGRAM frames when the application protocol running over QUIC 86 is HTTP/3 [I-D.ietf-quic-http], which is negotiated using ALPN 87 [RFC7301] with an identifier such as "h3-24". The HTTP/3 DATAGRAM 88 frame is transmitted as the QUIC DATAGRAM frame Datagram Data field. 89 It contains a flow identifier field that can be used for 90 demultiplexing applications, and an HTTP/3 Datagram Payload field 91 whose semantics are defined by individual applications. 93 Since the QUIC DATAGRAM and HTTP/3 DATAGRAM specifications leave the 94 semantic higher-order behaviour undefined, it is difficult to prove 95 the interoperability of implementations. This document defines 96 SiDUCK (Simple Datagram Usability and Connectivity Kata), a new 97 application that maps directly to QUIC DATAGRAM and uses the Datagram 98 Data field directly to support a simple client-server echo service. 100 Using QUIC DATAGRAM directly provides the benefit of avoiding 101 complexity of HTTP/3 session establishment and flow identifier 102 allocation and demultiplxing. SiDUCK's simpler application semantics 103 allow implementers to exercise the interoperability of foundational 104 layers of DATAGRAM, building progressive assurance that benefits the 105 design and robustness of other DATAGRAM-using applications. 107 1.1. Notational Conventions 109 The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", 110 "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this 111 document are to be interpreted as described in [RFC2119]. 113 The terms sh-token and sh-boolean are imported from 114 [STRUCTURED-HEADERS]. 116 Example HTTP requests and responses use the HTTP/2-style formatting 117 from [RFC7540]. 119 This document uses the variable-length integer encoding from 120 [I-D.ietf-quic-transport]. 122 2. Negotiating SiDUCK 124 SiDUCK is an application protocol that runs atop QUIC. The token 125 "siduck" is used to identify SiDUCK in ALPN, used during QUIC 126 connection establishment. Only implementations of the final, 127 published RFC can identify themselves as "siduck". Until such an RFC 128 exists, implementations MUST NOT identify themselves using this 129 string. 131 *RFC Editor's Note:* Please remove the following prior to 132 publication of a final version of this document. 134 Implementations of draft versions of the protocol MUST add the string 135 "-" and the corresponding draft number to the identifier. For 136 example, draft-pardue-quic-siduck-00 is identified using the string 137 "siduck-00". 139 Non-compatible experiments that are based on these draft versions 140 MUST append the string "-" and an experiment name to the identifier. 141 For example, an experimental implementation based on draft-pardue- 142 quic-siduck-09 which extends the permitted message types to include 143 "honk" might identify itself as "siduck-09-goose". Note that any 144 label MUST conform to the "token" syntax defined in Section 3.2.6 of 145 [RFC7230]. 147 3. Protocol Behaviour 149 A SiDUCK session consists of a client and server. Once a SiDUCK 150 session is established, the client SHOULD send a QUIC DATAGRAM frame 151 with the Datagram Data field containing "quack". A server that 152 receives a quack, MUST respond with a QUIC DATAGRAM frame with the 153 Datagram Data field containing "quack-ack". 155 A client MUST NOT send any other message than "quack". A server that 156 receives a non-quack message MUST close the connection with an error 157 of type SIDUCK_ONLY_QUACKS_ECHO. 159 4. The SIDUCK_ONLY_QUACKS_ECHO error code 161 This document defines the SIDUCK_ONLY_QUACKS_ECHO QUIC Application 162 error code. It has the value 0x101. 164 5. Known Issues / Problems 166 o The design does not permit large DATAGRAM frames. Sending these 167 in a simple application protocol would be beneficial and within 168 the scope of SiDUCK's goals. 170 o The design does not specify requirements on Transport Parameters. 171 For example, since streams are not used, the spec could require 172 that endpoints send max_streams_{bidi|uni} with the value 0. 174 6. Security Considerations 176 There are not believed to be any further security considerations 177 beyond those presented in [I-D.ietf-quic-transport]. 179 7. IANA Considerations 181 TBD 183 8. References 185 8.1. Normative References 187 [I-D.ietf-quic-transport] 188 Iyengar, J. and M. Thomson, "QUIC: A UDP-Based Multiplexed 189 and Secure Transport", draft-ietf-quic-transport-23 (work 190 in progress), September 2019. 192 [I-D.pauly-quic-datagram] 193 Pauly, T., Kinnear, E., and D. Schinazi, "An Unreliable 194 Datagram Extension to QUIC", draft-pauly-quic-datagram-04 195 (work in progress), October 2019. 197 [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate 198 Requirement Levels", BCP 14, RFC 2119, 199 DOI 10.17487/RFC2119, March 1997, 200 . 202 [RFC7230] Fielding, R., Ed. and J. Reschke, Ed., "Hypertext Transfer 203 Protocol (HTTP/1.1): Message Syntax and Routing", 204 RFC 7230, DOI 10.17487/RFC7230, June 2014, 205 . 207 [RFC7301] Friedl, S., Popov, A., Langley, A., and E. Stephan, 208 "Transport Layer Security (TLS) Application-Layer Protocol 209 Negotiation Extension", RFC 7301, DOI 10.17487/RFC7301, 210 July 2014, . 212 [STRUCTURED-HEADERS] 213 Nottingham, M. and P. Kamp, "Structured Headers for HTTP", 214 draft-ietf-httpbis-header-structure-14 (work in progress), 215 October 2019. 217 8.2. Informative References 219 [I-D.ietf-quic-http] 220 Bishop, M., "Hypertext Transfer Protocol Version 3 221 (HTTP/3)", draft-ietf-quic-http-23 (work in progress), 222 September 2019. 224 [I-D.schinazi-quic-h3-datagram] 225 Schinazi, D., "Using QUIC Datagrams with HTTP/3", draft- 226 schinazi-quic-h3-datagram-01 (work in progress), October 227 2019. 229 [RFC7540] Belshe, M., Peon, R., and M. Thomson, Ed., "Hypertext 230 Transfer Protocol Version 2 (HTTP/2)", RFC 7540, 231 DOI 10.17487/RFC7540, May 2015, 232 . 234 8.3. URIs 236 [1] https://mailarchive.ietf.org/arch/browse/quic/ 238 [2] https://github.com/lpardue/draft-pardue-quic-siduck 240 Appendix A. Acknowledgements 242 Thanks to Andy Stitzer who achieved interop of an unpublished early 243 SiDUCK specification during the IETF 106 Hackathon. 245 Author's Address 247 Lucas Pardue 249 Email: lucaspardue.24.7@gmail.com