- From: Ilari Liusvaara <ilari.liusvaara@elisanet.fi>
- Date: Tue, 2 Jul 2013 20:17:47 +0300
- To: RUELLAN Herve <Herve.Ruellan@crf.canon.fr>
- Cc: James M Snell <jasnell@gmail.com>, Mike Bishop <Michael.Bishop@microsoft.com>, "ietf-http-wg@w3.org" <ietf-http-wg@w3.org>
On Tue, Jul 02, 2013 at 01:29:22PM +0000, RUELLAN Herve wrote: > > The eviction mechanism uses the table order: when the size of the header > table is greater than the limit, then the first entry is dropped. This > is repeated until the header table size becomes smaller than the limit. > The entries are renumbered to keep the indexes small. How to handle (slightly pathological) case where write causes modified entry itself to get evicted? E.g. Perform substitution on entry #1, with value long enough to cause 2 (or 3) headers to get evicted to make space. Also, there is no operation that could be used to "refresh" header table entries without explicitly coding for value? Since some headers could be quite expensive to code (that one WAP-related header anyone?), one would want to keep those live... Also, performing large enough write to bust the header table in one shot is probably a fatal error, no? Since there is synchronized (and persistent) state involved, it is quite important that both ends handle all sorts of weird corner cases in the same way... -Ilari
Received on Tuesday, 2 July 2013 17:18:12 UTC