Re: [quicwg/base-drafts] Persistent congestion pseudocode to match text (#4010)

[Kazu Yamamoto <[e-mail]>]

> Regarding the global sequence space, I figure that you can do this without a global sequence number in other ways. For instance, you could track the sending time of all outstanding packets or you could enter all outstanding packets into a linked list, either of which allows you to establish a total ordering. 

Yes. I think that this is what @kazuho explains in https://github.com/quicwg/base-drafts/issues/3939#issuecomment-662808337.

(It seems to me that this assumes entries can be *marked* to detect *contiguity*. But it is very hard to implement marking in Haskell. Marking is a destructive operation which is not allowed in purely functional data structure.)

What I pointed out is that there is no such data structure in the current pseudocode. (`sent_packets` is separated into three.) Probably, *global* sequence number is one of the easiest approaches.


-- 
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
https://github.com/quicwg/base-drafts/pull/4010#issuecomment-678911640