/
draft-ietf-quic-qpack.txt
2072 lines (1412 loc) · 82.8 KB
/
draft-ietf-quic-qpack.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
QUIC C. Krasic
Internet-Draft Netflix
Intended status: Standards Track M. Bishop
Expires: December 23, 2019 Akamai Technologies
A. Frindell, Ed.
Facebook
June 21, 2019
QPACK: Header Compression for HTTP/3
draft-ietf-quic-qpack-latest
Abstract
This specification defines QPACK, a compression format for
efficiently representing HTTP header fields, to be used in HTTP/3.
This is a variation of HPACK header compression that seeks to reduce
head-of-line blocking.
Note to Readers
Discussion of this draft takes place on the QUIC working group
mailing list (quic@ietf.org), which is archived at
https://mailarchive.ietf.org/arch/search/?email_list=quic [1].
Working Group information can be found at https://github.com/quicwg
[2]; source code and issues list for this draft can be found at
https://github.com/quicwg/base-drafts/labels/-qpack [3].
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 https://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 December 23, 2019.
Krasic, et al. Expires December 23, 2019 [Page 1]
Internet-Draft QPACK June 2019
Copyright Notice
Copyright (c) 2019 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://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.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1. Conventions and Definitions . . . . . . . . . . . . . . . 4
1.2. Notational Conventions . . . . . . . . . . . . . . . . . 5
2. Compression Process Overview . . . . . . . . . . . . . . . . 5
2.1. Encoder . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.1.1. Reference Tracking . . . . . . . . . . . . . . . . . 6
2.1.2. Blocked Dynamic Table Insertions . . . . . . . . . . 6
2.1.3. Avoiding Head-of-Line Blocking . . . . . . . . . . . 7
2.1.4. Known Received Count . . . . . . . . . . . . . . . . 8
2.2. Decoder . . . . . . . . . . . . . . . . . . . . . . . . . 8
2.2.1. State Synchronization . . . . . . . . . . . . . . . . 9
2.2.2. Blocked Decoding . . . . . . . . . . . . . . . . . . 9
3. Header Tables . . . . . . . . . . . . . . . . . . . . . . . . 9
3.1. Static Table . . . . . . . . . . . . . . . . . . . . . . 9
3.2. Dynamic Table . . . . . . . . . . . . . . . . . . . . . . 10
3.2.1. Dynamic Table Size . . . . . . . . . . . . . . . . . 10
3.2.2. Dynamic Table Capacity and Eviction . . . . . . . . . 10
3.2.3. Maximum Dynamic Table Capacity . . . . . . . . . . . 11
3.2.4. Absolute Indexing . . . . . . . . . . . . . . . . . . 12
3.2.5. Relative Indexing . . . . . . . . . . . . . . . . . . 12
3.2.6. Post-Base Indexing . . . . . . . . . . . . . . . . . 13
3.2.7. Invalid References . . . . . . . . . . . . . . . . . 13
4. Wire Format . . . . . . . . . . . . . . . . . . . . . . . . . 14
4.1. Primitives . . . . . . . . . . . . . . . . . . . . . . . 14
4.1.1. Prefixed Integers . . . . . . . . . . . . . . . . . . 14
4.1.2. String Literals . . . . . . . . . . . . . . . . . . . 14
4.2. Instructions . . . . . . . . . . . . . . . . . . . . . . 14
4.2.1. Encoder and Decoder Streams . . . . . . . . . . . . . 15
4.3. Encoder Instructions . . . . . . . . . . . . . . . . . . 15
4.3.1. Insert With Name Reference . . . . . . . . . . . . . 16
4.3.2. Insert Without Name Reference . . . . . . . . . . . . 16
Krasic, et al. Expires December 23, 2019 [Page 2]
Internet-Draft QPACK June 2019
4.3.3. Duplicate . . . . . . . . . . . . . . . . . . . . . . 17
4.3.4. Set Dynamic Table Capacity . . . . . . . . . . . . . 17
4.4. Decoder Instructions . . . . . . . . . . . . . . . . . . 18
4.4.1. Insert Count Increment . . . . . . . . . . . . . . . 18
4.4.2. Header Acknowledgement . . . . . . . . . . . . . . . 18
4.4.3. Stream Cancellation . . . . . . . . . . . . . . . . . 19
4.5. Header Block Instructions . . . . . . . . . . . . . . . . 20
4.5.1. Header Block Prefix . . . . . . . . . . . . . . . . . 20
4.5.2. Indexed Header Field . . . . . . . . . . . . . . . . 22
4.5.3. Indexed Header Field With Post-Base Index . . . . . . 23
4.5.4. Literal Header Field With Name Reference . . . . . . 23
4.5.5. Literal Header Field With Post-Base Name Reference . 24
4.5.6. Literal Header Field Without Name Reference . . . . . 25
5. Configuration . . . . . . . . . . . . . . . . . . . . . . . . 25
6. Error Handling . . . . . . . . . . . . . . . . . . . . . . . 26
7. Security Considerations . . . . . . . . . . . . . . . . . . . 26
8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 26
8.1. Settings Registration . . . . . . . . . . . . . . . . . . 26
8.2. Stream Type Registration . . . . . . . . . . . . . . . . 26
8.3. Error Code Registration . . . . . . . . . . . . . . . . . 27
9. References . . . . . . . . . . . . . . . . . . . . . . . . . 27
9.1. Normative References . . . . . . . . . . . . . . . . . . 27
9.2. Informative References . . . . . . . . . . . . . . . . . 28
9.3. URIs . . . . . . . . . . . . . . . . . . . . . . . . . . 28
Appendix A. Static Table . . . . . . . . . . . . . . . . . . . . 28
Appendix B. Sample One Pass Encoding Algorithm . . . . . . . . . 33
Appendix C. Change Log . . . . . . . . . . . . . . . . . . . . . 35
C.1. Since draft-ietf-quic-qpack-06 . . . . . . . . . . . . . 35
C.2. Since draft-ietf-quic-qpack-05 . . . . . . . . . . . . . 35
C.3. Since draft-ietf-quic-qpack-04 . . . . . . . . . . . . . 35
C.4. Since draft-ietf-quic-qpack-03 . . . . . . . . . . . . . 35
C.5. Since draft-ietf-quic-qpack-02 . . . . . . . . . . . . . 35
C.6. Since draft-ietf-quic-qpack-01 . . . . . . . . . . . . . 36
C.7. Since draft-ietf-quic-qpack-00 . . . . . . . . . . . . . 36
C.8. Since draft-ietf-quic-qcram-00 . . . . . . . . . . . . . 36
Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . 36
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 37
1. Introduction
The QUIC transport protocol was designed from the outset to support
HTTP semantics, and its design subsumes many of the features of
HTTP/2. HTTP/2 uses HPACK ([RFC7541]) for header compression, but
QUIC's stream multiplexing comes into some conflict with HPACK. A
key goal of the design of QUIC is to improve stream multiplexing
relative to HTTP/2 by reducing head-of-line blocking. If HPACK were
used for HTTP/3, it would induce head-of-line blocking due to built-
in assumptions of a total ordering across frames on all streams.
Krasic, et al. Expires December 23, 2019 [Page 3]
Internet-Draft QPACK June 2019
QUIC is described in [QUIC-TRANSPORT]. The HTTP/3 mapping is
described in [HTTP3]. For a full description of HTTP/2, see
[RFC7540]. The description of HPACK is [RFC7541].
QPACK reuses core concepts from HPACK, but is redesigned to allow
correctness in the presence of out-of-order delivery, with
flexibility for implementations to balance between resilience against
head-of-line blocking and optimal compression ratio. The design
goals are to closely approach the compression ratio of HPACK with
substantially less head-of-line blocking under the same loss
conditions.
1.1. Conventions and Definitions
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.
Definitions of terms that are used in this document:
Header field: A name-value pair sent as part of an HTTP message.
Header list: An ordered collection of header fields associated with
an HTTP message. A header list can contain multiple header fields
with the same name. It can also contain duplicate header fields.
Header block: The compressed representation of a header list.
Encoder: An implementation which transforms a header list into a
header block.
Decoder: An implementation which transforms a header block into a
header list.
Absolute Index: A unique index for each entry in the dynamic table.
Base: A reference point for relative indices. Dynamic references
are made relative to a Base in header blocks.
Insert Count: The total number of entries inserted in the dynamic
table.
QPACK is a name, not an acronym.
Krasic, et al. Expires December 23, 2019 [Page 4]
Internet-Draft QPACK June 2019
1.2. Notational Conventions
Diagrams use the format described in Section 3.1 of [RFC2360], with
the following additional conventions:
x (A) Indicates that x is A bits long
x (A+) Indicates that x uses the prefixed integer encoding defined
in Section 5.1 of [RFC7541], beginning with an A-bit prefix.
x ... Indicates that x is variable-length and extends to the end of
the region.
2. Compression Process Overview
Like HPACK, QPACK uses two tables for associating header fields to
indices. The static table (see Section 3.1) is predefined and
contains common header fields (some of them with an empty value).
The dynamic table (see Section 3.2) is built up over the course of
the connection and can be used by the encoder to index header fields
in the encoded header lists.
QPACK instructions appear in three different types of streams:
o The encoder uses a unidirectional stream to modify the state of
the dynamic table without emitting header fields associated with
any particular request.
o HEADERS and PUSH_PROMISE frames on request and push streams
reference the table state without modifying it.
o The decoder sends feedback to the encoder on a unidirectional
stream. This feedback enables the encoder to manage dynamic table
state.
2.1. Encoder
An encoder compresses a header list by emitting either an indexed or
a literal representation for each header field in the list.
References to the static table and literal representations do not
require any dynamic state and never risk head-of-line blocking.
References to the dynamic table risk head-of-line blocking if the
encoder has not received an acknowledgement indicating the entry is
available at the decoder.
An encoder MAY insert any entry in the dynamic table it chooses; it
is not limited to header fields it is compressing.
Krasic, et al. Expires December 23, 2019 [Page 5]
Internet-Draft QPACK June 2019
QPACK preserves the ordering of header fields within each header
list. An encoder MUST emit header field representations in the order
they appear in the input header list.
QPACK is designed to contain the more complex state tracking to the
encoder, while the decoder is relatively simple.
2.1.1. Reference Tracking
An encoder MUST ensure that a header block which references a dynamic
table entry is not received by the decoder after the referenced entry
has been evicted. Hence the encoder needs to track information about
each compressed header block that references the dynamic table until
that header block is acknowledged by the decoder.
2.1.2. Blocked Dynamic Table Insertions
A dynamic table entry is considered blocking and cannot be evicted
until its insertion has been acknowledged and there are no
outstanding unacknowledged references to the entry. In particular, a
dynamic table entry that has never been referenced can still be
blocking.
Note: A blocking entry is unrelated to a blocked stream, which is a
stream that a decoder cannot decode as a result of references to
entries that are not yet available. Any encoder that uses the
dynamic table has to keep track of blocked entries, whereas
blocked streams are optional.
An encoder MUST NOT insert an entry into the dynamic table (or
duplicate an existing entry) if doing so would evict a blocking
entry. In this case, the encoder can send literal representations of
header fields.
To ensure that the encoder is not prevented from adding new entries,
the encoder can avoid referencing entries that are close to eviction.
Rather than reference such an entry, the encoder can emit a Duplicate
instruction (see Section 4.3.3), and reference the duplicate instead.
Determining which entries are too close to eviction to reference is
an encoder preference. One heuristic is to target a fixed amount of
available space in the dynamic table: either unused space or space
that can be reclaimed by evicting non-blocking entries. To achieve
this, the encoder can maintain a draining index, which is the
smallest absolute index in the dynamic table that it will emit a
reference for. As new entries are inserted, the encoder increases
the draining index to maintain the section of the table that it will
not reference. If the encoder does not create new references to
Krasic, et al. Expires December 23, 2019 [Page 6]
Internet-Draft QPACK June 2019
entries with an absolute index lower than the draining index, the
number of unacknowledged references to those entries will eventually
become zero, allowing them to be evicted.
+----------+---------------------------------+--------+
| Draining | Referenceable | Unused |
| Entries | Entries | Space |
+----------+---------------------------------+--------+
^ ^ ^
| | |
Dropping Draining Index Insertion Point
Point
Figure 1: Draining Dynamic Table Entries
2.1.3. Avoiding Head-of-Line Blocking
Because QUIC does not guarantee order between data on different
streams, a header block might reference an entry in the dynamic table
that has not yet been received.
Each header block contains a Required Insert Count, the lowest
possible value for the Insert Count with which the header block can
be decoded. For a header block with references to the dynamic table,
the Required Insert Count is one larger than the largest Absolute
Index of all referenced dynamic table entries. For a header block
with no references to the dynamic table, the Required Insert Count is
zero.
If the decoder encounters a header block with a Required Insert Count
value larger than defined above, it MAY treat this as a connection
error of type HTTP_QPACK_DECOMPRESSION_FAILED. If the decoder
encounters a header block with a Required Insert Count value smaller
than defined above, it MUST treat this as a connection error of type
HTTP_QPACK_DECOMPRESSION_FAILED as prescribed in Section 3.2.7.
When the Required Insert Count is zero, the frame contains no
references to the dynamic table and can always be processed
immediately.
If the Required Insert Count is greater than the number of dynamic
table entries received, the stream is considered "blocked." While
blocked, header field data SHOULD remain in the blocked stream's flow
control window. A stream becomes unblocked when the Insert Count
becomes greater than or equal to the Required Insert Count for all
header blocks the decoder has started reading from the stream.
Krasic, et al. Expires December 23, 2019 [Page 7]
Internet-Draft QPACK June 2019
The SETTINGS_QPACK_BLOCKED_STREAMS setting (see Section 5) specifies
an upper bound on the number of streams which can be blocked. An
encoder MUST limit the number of streams which could become blocked
to the value of SETTINGS_QPACK_BLOCKED_STREAMS at all times. Note
that the decoder might not actually become blocked on every stream
which risks becoming blocked. If the decoder encounters more blocked
streams than it promised to support, it MUST treat this as a
connection error of type HTTP_QPACK_DECOMPRESSION_FAILED.
An encoder can decide whether to risk having a stream become blocked.
If permitted by the value of SETTINGS_QPACK_BLOCKED_STREAMS,
compression efficiency can often be improved by referencing dynamic
table entries that are still in transit, but if there is loss or
reordering the stream can become blocked at the decoder. An encoder
avoids the risk of blocking by only referencing dynamic table entries
which have been acknowledged, but this could mean using literals.
Since literals make the header block larger, this can result in the
encoder becoming blocked on congestion or flow control limits.
2.1.4. Known Received Count
In order to identify which dynamic table entries can be safely used
without a stream becoming blocked, the encoder tracks the number of
entries received by the decoder. The Known Received Count tracks the
total number of acknowledged insertions.
When blocking references are permitted, the encoder uses header block
acknowledgement to maintain the Known Received Count, as described in
Section 4.4.2.
To acknowledge dynamic table entries which are not referenced by
header blocks, for example because the encoder or the decoder have
chosen not to risk blocked streams, the decoder sends an Insert Count
Increment instruction (see Section 4.4.1).
2.2. Decoder
As in HPACK, the decoder processes header blocks and emits the
corresponding header lists. It also processes dynamic table
modifications from encoder instructions received on the encoder
stream.
The decoder MUST emit header fields in the order their
representations appear in the input header block.
Krasic, et al. Expires December 23, 2019 [Page 8]
Internet-Draft QPACK June 2019
2.2.1. State Synchronization
The decoder instructions (Section 4.4) signal key events at the
decoder that permit the encoder to track the decoder's state. These
events are:
o Complete processing of a header block
o Abandonment of a stream which might have remaining header blocks
o Receipt of new dynamic table entries
Knowledge that a header block with references to the dynamic table
has been processed permits the encoder to evict entries to which no
unacknowledged references remain (see Section 2.1.2). When a stream
is reset or abandoned, the indication that these header blocks will
never be processed serves a similar function (see Section 4.4.3).
The decoder chooses when to emit Insert Count Increment instructions
(see Section 4.4.1). Emitting an instruction after adding each new
dynamic table entry will provide the most timely feedback to the
encoder, but could be redundant with other decoder feedback. By
delaying an Insert Count Increment instruction, the decoder might be
able to coalesce multiple Insert Count Increment instructions, or
replace them entirely with Header Acknowledgements (see
Section 4.4.2). However, delaying too long may lead to compression
inefficiencies if the encoder waits for an entry to be acknowledged
before using it.
2.2.2. Blocked Decoding
To track blocked streams, the Required Insert Count value for each
stream can be used. Whenever the decoder processes a table update,
it can begin decoding any blocked streams that now have their
dependencies satisfied.
3. Header Tables
Unlike in HPACK, entries in the QPACK static and dynamic tables are
addressed separately. The following sections describe how entries in
each table are addressed.
3.1. Static Table
The static table consists of a predefined static list of header
fields, each of which has a fixed index over time. Its entries are
defined in Appendix A.
Krasic, et al. Expires December 23, 2019 [Page 9]
Internet-Draft QPACK June 2019
All entries in the static table have a name and a value. However,
values can be empty (that is, have a length of 0).
Note the QPACK static table is indexed from 0, whereas the HPACK
static table is indexed from 1.
When the decoder encounters an invalid static table index in a header
block instruction it MUST treat this as a connection error of type
"HTTP_QPACK_DECOMPRESSION_FAILED". If this index is received on the
encoder stream, this MUST be treated as a connection error of type
"HTTP_QPACK_ENCODER_STREAM_ERROR".
3.2. Dynamic Table
The dynamic table consists of a list of header fields maintained in
first-in, first-out order. Each HTTP/3 endpoint holds a dynamic
table that is initially empty. Entries are added by encoder
instructions received on the encoder stream (see Section 4.3).
The dynamic table can contain duplicate entries (i.e., entries with
the same name and same value). Therefore, duplicate entries MUST NOT
be treated as an error by the decoder.
3.2.1. Dynamic Table Size
The size of the dynamic table is the sum of the size of its entries.
The size of an entry is the sum of its name's length in bytes (as
defined in Section 4.1.2), its value's length in bytes, and 32.
The size of an entry is calculated using the length of its name and
value without Huffman encoding applied.
3.2.2. Dynamic Table Capacity and Eviction
The encoder sets the capacity of the dynamic table, which serves as
the upper limit on its size. The initial capacity of the dynamic
table is zero.
Before a new entry is added to the dynamic table, entries are evicted
from the end of the dynamic table until the size of the dynamic table
is less than or equal to (table capacity - size of new entry) or
until the table is empty. The encoder MUST NOT evict a blocking
dynamic table entry (see Section 2.1.2).
If the size of the new entry is less than or equal to the dynamic
table capacity, then that entry is added to the table. It is an
error if the encoder attempts to add an entry that is larger than the
Krasic, et al. Expires December 23, 2019 [Page 10]
Internet-Draft QPACK June 2019
dynamic table capacity; the decoder MUST treat this as a connection
error of type "HTTP_QPACK_ENCODER_STREAM_ERROR".
A new entry can reference an entry in the dynamic table that will be
evicted when adding this new entry into the dynamic table.
Implementations are cautioned to avoid deleting the referenced name
or value if the referenced entry is evicted from the dynamic table
prior to inserting the new entry.
Whenever the dynamic table capacity is reduced by the encoder,
entries are evicted from the end of the dynamic table until the size
of the dynamic table is less than or equal to the new table capacity.
This mechanism can be used to completely clear entries from the
dynamic table by setting a capacity of 0, which can subsequently be
restored.
3.2.3. Maximum Dynamic Table Capacity
To bound the memory requirements of the decoder, the decoder limits
the maximum value the encoder is permitted to set for the dynamic
table capacity. In HTTP/3, this limit is determined by the value of
SETTINGS_QPACK_MAX_TABLE_CAPACITY sent by the decoder (see
Section 5). The encoder MUST not set a dynamic table capacity that
exceeds this maximum, but it can choose to use a lower dynamic table
capacity (see Section 4.3.4).
For clients using 0-RTT data in HTTP/3, the server's maximum table
capacity is the remembered value of the setting, or zero if the value
was not previously sent. When the client's 0-RTT value of the
SETTING is 0, the server MAY set it to a non-zero value in its
SETTINGS frame. If the remembered value is non-zero, the server MUST
send the same non-zero value in its SETTINGS frame. If it specifies
any other value, or omits SETTINGS_QPACK_MAX_TABLE_CAPACITY from
SETTINGS, the encoder must treat this as a connection error of type
"HTTP_QPACK_DECODER_STREAM_ERROR".
For HTTP/3 servers and HTTP/3 clients when 0-RTT is not attempted or
is rejected, the maximum table capacity is 0 until the encoder
processes a SETTINGS frame with a non-zero value of
SETTINGS_QPACK_MAX_TABLE_CAPACITY.
When the maximum table capacity is 0, the encoder MUST NOT insert
entries into the dynamic table, and MUST NOT send any encoder
instructions on the encoder stream.
Krasic, et al. Expires December 23, 2019 [Page 11]
Internet-Draft QPACK June 2019
3.2.4. Absolute Indexing
Each entry possesses both an absolute index which is fixed for the
lifetime of that entry and a relative index which changes based on
the context of the reference. The first entry inserted has an
absolute index of "0"; indices increase by one with each insertion.
3.2.5. Relative Indexing
The relative index begins at zero and increases in the opposite
direction from the absolute index. Determining which entry has a
relative index of "0" depends on the context of the reference.
In encoder instructions, a relative index of "0" always refers to the
most recently inserted value in the dynamic table. Note that this
means the entry referenced by a given relative index will change
while interpreting instructions on the encoder stream.
+-----+---------------+-------+
| n-1 | ... | d | Absolute Index
+ - - +---------------+ - - - +
| 0 | ... | n-d-1 | Relative Index
+-----+---------------+-------+
^ |
| V
Insertion Point Dropping Point
n = count of entries inserted
d = count of entries dropped
Example Dynamic Table Indexing - Control Stream
Unlike encoder instructions, relative indices in header block
instructions are relative to the Base at the beginning of the header
block (see Section 4.5.1). This ensures that references are stable
even if the dynamic table is updated while decoding a header block.
The Base is encoded as a value relative to the Required Insert Count.
The Base identifies which dynamic table entries can be referenced
using relative indexing, starting with 0 at the last entry added.
Post-Base references are used for entries inserted after base,
starting at 0 for the first entry added after the Base; see
Section 3.2.6.
Krasic, et al. Expires December 23, 2019 [Page 12]
Internet-Draft QPACK June 2019
Required
Insert
Count Base
| |
V V
+-----+-----+-----+-----+-------+
| n-1 | n-2 | n-3 | ... | d | Absolute Index
+-----+-----+ - +-----+ - +
| 0 | ... | n-d-3 | Relative Index
+-----+-----+-------+
n = count of entries inserted
d = count of entries dropped
Example Dynamic Table Indexing - Relative Index in Header Block
3.2.6. Post-Base Indexing
A header block can reference entries added after the entry identified
by the Base. This allows an encoder to process a header block in a
single pass and include references to entries added while processing
this (or other) header blocks. Newly added entries are referenced
using Post-Base instructions. Indices for Post-Base instructions
increase in the same direction as absolute indices, with the zero
value being the first entry inserted after the Base.
Base
|
V
+-----+-----+-----+-----+-----+
| n-1 | n-2 | n-3 | ... | d | Absolute Index
+-----+-----+-----+-----+-----+
| 1 | 0 | Post-Base Index
+-----+-----+
n = count of entries inserted
d = count of entries dropped
Example Dynamic Table Indexing - Post-Base Index in Header Block
3.2.7. Invalid References
If the decoder encounters a reference in a header block instruction
to a dynamic table entry which has already been evicted or which has
an absolute index greater than or equal to the declared Required
Insert Count (see Section 4.5.1), it MUST treat this as a connection
error of type "HTTP_QPACK_DECOMPRESSION_FAILED".
Krasic, et al. Expires December 23, 2019 [Page 13]
Internet-Draft QPACK June 2019
If the decoder encounters a reference in an encoder instruction to a
dynamic table entry which has already been dropped, it MUST treat
this as a connection error of type "HTTP_QPACK_ENCODER_STREAM_ERROR".
4. Wire Format
4.1. Primitives
4.1.1. Prefixed Integers
The prefixed integer from Section 5.1 of [RFC7541] is used heavily
throughout this document. The format from [RFC7541] is used
unmodified. QPACK implementations MUST be able to decode integers up
to 62 bits long.
4.1.2. String Literals
The string literal defined by Section 5.2 of [RFC7541] is also used
throughout. This string format includes optional Huffman encoding.
HPACK defines string literals to begin on a byte boundary. They
begin with a single flag (indicating whether the string is Huffman-
coded), followed by the Length encoded as a 7-bit prefix integer, and
finally Length bytes of data. When Huffman encoding is enabled, the
Huffman table from Appendix B of [RFC7541] is used without
modification.
This document expands the definition of string literals and permits
them to begin other than on a byte boundary. An "N-bit prefix string
literal" begins with the same Huffman flag, followed by the length
encoded as an (N-1)-bit prefix integer. The remainder of the string
literal is unmodified.
A string literal without a prefix length noted is an 8-bit prefix
string literal and follows the definitions in [RFC7541] without
modification.
4.2. Instructions
There are three separate QPACK instruction spaces. Encoder
instructions (Section 4.3) carry table updates, decoder instructions
(Section 4.4) carry acknowledgments of table modifications and header
processing, and header block instructions (Section 4.5) convey an
encoded representation of a header list by referring to the QPACK
table state.
Encoder and decoder instructions appear on the unidirectional stream
types described in this section. Header block instructions are
Krasic, et al. Expires December 23, 2019 [Page 14]
Internet-Draft QPACK June 2019
contained in HEADERS and PUSH_PROMISE frames, which are conveyed on
request or push streams as described in [HTTP3].
4.2.1. Encoder and Decoder Streams
QPACK defines two unidirectional stream types:
o An encoder stream is a unidirectional stream of type "0x02". It
carries an unframed sequence of encoder instructions from encoder
to decoder.
o A decoder stream is a unidirectional stream of type "0x03". It
carries an unframed sequence of decoder instructions from decoder
to encoder.
HTTP/3 endpoints contain a QPACK encoder and decoder. Each endpoint
MUST initiate at most one encoder stream and at most one decoder
stream. Receipt of a second instance of either stream type MUST be
treated as a connection error of type HTTP_WRONG_STREAM_COUNT. These
streams MUST NOT be closed. Closure of either unidirectional stream
type MUST be treated as a connection error of type
HTTP_CLOSED_CRITICAL_STREAM.
An endpoint MAY avoid creating its own encoder stream if it's not
going to be used (for example if the endpoint doesn't wish to use the
dynamic table, or if the maximum size of the dynamic table permitted
by the peer is zero).
An endpoint MAY avoid creating its own decoder stream if the maximum
size of its own dynamic table is zero.
An endpoint MUST allow its peer to create both encoder and decoder
streams even if the connection's settings prevent their use.
4.3. Encoder Instructions
Table updates can add a table entry, possibly using existing entries
to avoid transmitting redundant information. The name can be
transmitted as a reference to an existing entry in the static or the
dynamic table or as a string literal. For entries which already
exist in the dynamic table, the full entry can also be used by
reference, creating a duplicate entry.
This section specifies the following encoder instructions.
Krasic, et al. Expires December 23, 2019 [Page 15]
Internet-Draft QPACK June 2019
4.3.1. Insert With Name Reference
An addition to the header table where the header field name matches
the header field name of an entry stored in the static table or the
dynamic table starts with the '1' one-bit pattern. The "S" bit
indicates whether the reference is to the static (S=1) or dynamic
(S=0) table. The 6-bit prefix integer (see Section 5.1 of [RFC7541])
that follows is used to locate the table entry for the header name.
When S=1, the number represents the static table index; when S=0, the
number is the relative index of the entry in the dynamic table.
The header name reference is followed by the header field value
represented as a string literal (see Section 5.2 of [RFC7541]).
0 1 2 3 4 5 6 7
+---+---+---+---+---+---+---+---+
| 1 | S | Name Index (6+) |
+---+---+-----------------------+
| H | Value Length (7+) |
+---+---------------------------+
| Value String (Length bytes) |
+-------------------------------+
Insert Header Field -- Indexed Name
4.3.2. Insert Without Name Reference
An addition to the header table where both the header field name and
the header field value are represented as string literals (see
Section 4.1) starts with the '01' two-bit pattern.
The name is represented as a 6-bit prefix string literal, while the
value is represented as an 8-bit prefix string literal.
0 1 2 3 4 5 6 7
+---+---+---+---+---+---+---+---+
| 0 | 1 | H | Name Length (5+) |
+---+---+---+-------------------+
| Name String (Length bytes) |
+---+---------------------------+
| H | Value Length (7+) |
+---+---------------------------+
| Value String (Length bytes) |
+-------------------------------+
Insert Header Field -- New Name
Krasic, et al. Expires December 23, 2019 [Page 16]
Internet-Draft QPACK June 2019
4.3.3. Duplicate
Duplication of an existing entry in the dynamic table starts with the
'000' three-bit pattern. The relative index of the existing entry is
represented as an integer with a 5-bit prefix.
0 1 2 3 4 5 6 7
+---+---+---+---+---+---+---+---+
| 0 | 0 | 0 | Index (5+) |
+---+---+---+-------------------+
Figure 2: Duplicate
The existing entry is re-inserted into the dynamic table without
resending either the name or the value. This is useful to mitigate
the eviction of older entries which are frequently referenced, both
to avoid the need to resend the header and to avoid the entry in the
table blocking the ability to insert new headers.
4.3.4. Set Dynamic Table Capacity
An encoder informs the decoder of a change to the dynamic table
capacity using an instruction which begins with the '001' three-bit
pattern. The new dynamic table capacity is represented as an integer
with a 5-bit prefix (see Section 5.1 of [RFC7541]).
0 1 2 3 4 5 6 7
+---+---+---+---+---+---+---+---+
| 0 | 0 | 1 | Capacity (5+) |
+---+---+---+-------------------+
Figure 3: Set Dynamic Table Capacity
The new capacity MUST be lower than or equal to the limit described
in Section 3.2.3. In HTTP/3, this limit is the value of the
SETTINGS_QPACK_MAX_TABLE_CAPACITY parameter (see Section 5) received
from the decoder. The decoder MUST treat a new dynamic table
capacity value that exceeds this limit as a connection error of type
"HTTP_QPACK_ENCODER_STREAM_ERROR".
Reducing the dynamic table capacity can cause entries to be evicted
(see Section 3.2.2). This MUST NOT cause the eviction of blocking
entries (see Section 2.1.2). Changing the capacity of the dynamic
table is not acknowledged as this instruction does not insert an
entry.
Krasic, et al. Expires December 23, 2019 [Page 17]
Internet-Draft QPACK June 2019
4.4. Decoder Instructions
Decoder instructions provide information used to ensure consistency
of the dynamic table. They are sent from the decoder to the encoder
on a decoder stream; that is, the server informs the client about the
processing of the client's header blocks and table updates, and the
client informs the server about the processing of the server's header
blocks and table updates.
This section specifies the following decoder instructions.
4.4.1. Insert Count Increment
The Insert Count Increment instruction begins with the '00' two-bit
pattern. The instruction specifies the total number of dynamic table
inserts and duplications since the last Insert Count Increment or
Header Acknowledgement that increased the Known Received Count for
the dynamic table (see Section 2.1.4). The Increment field is
encoded as a 6-bit prefix integer. The encoder uses this value to
determine which table entries might cause a stream to become blocked,
as described in Section 2.2.1.
0 1 2 3 4 5 6 7
+---+---+---+---+---+---+---+---+
| 0 | 0 | Increment (6+) |
+---+---+-----------------------+
Figure 4: Insert Count Increment
An encoder that receives an Increment field equal to zero or one that
increases the Known Received Count beyond what the encoder has sent
MUST treat this as a connection error of type
"HTTP_QPACK_DECODER_STREAM_ERROR".
4.4.2. Header Acknowledgement
After processing a header block whose declared Required Insert Count
is not zero, the decoder emits a Header Acknowledgement instruction
on the decoder stream. The instruction begins with the '1' one-bit
pattern and includes the header block's associated stream ID, encoded
as a 7-bit prefix integer. It is used by the peer's encoder to know
when it is safe to evict an entry, and possibly update the Known
Received Count.