- From: 山本和彦 <kazu@iij.ad.jp>
- Date: Wed, 25 Jan 2017 07:55:10 +0900 (JST)
- To: ietf-http-wg@w3.org
Hi Tom, >> http://www.mew.org/~kazu/material/2015-http2-priority2.pdf >> http://www.mew.org/~kazu/doc/paper/http2-haskell-2016.pdf > > Thanks. IIUC, the algorithms described in both links are still at least > O(depth), which can be O(n) for dependency trees generated by certain > clients such as Chrome. Yes. Your understanding is correct. If a browser creates a list-like tree, I think it is misuse of priority. And servers should limit the depth of trees. --Kazu
Received on Tuesday, 24 January 2017 22:55:40 UTC