Talk:Bufferbloat/Archive 1
This is an archive of past discussions about Bufferbloat. Do not edit the contents of this page. If you wish to start a new discussion or revive an old one, please do so on the current talk page. |
Archive 1 |
Vs Jitter
Note that bufferbloat != Jitter I think this subject can get its own page. but maybe i am missing a good synosym where this is already discussed. :14:58, 7 January 2011 (UTC)
Control theory
Just a note: Maybe it is worth mentioning that Control theory says that control of systems with large delays from input to measurable response is difficult and easily results in unstable systems. I find this to be a reasonable explanation for difficulties TCP etc is having with large buffer sizes. —Preceding unsigned comment added by 79.136.60.104 (talk) 02:19, 27 February 2011 (UTC)
Ars article
This needs to be Incorporated in the article:
He mentions that TCP congestion control—not flow control, that's something else—requires dropped packets to function, but that's not entirely true. TCP's transmission speed can be limited by the send and/or receive buffers and the round-trip time, or it can slow down because packets get lost. Both excessive buffering and excessive packet loss are unpleasant, so it's good to find some middle ground. :14:01, 10 January 2011 (UTC)
- This is pretty moot: modern TCP's (anything later than Windows XP) do window scaling, and can and will fill arbitrary sized buffers with even a single TCP flowJimGettys (talk) 18:34, 19 December 2011 (UTC)
This article still needs some serious rework
(JimGettys writes:)
Oh, also note that my blog, while correct at the 95% level, has some errors; as far as I know, the ACM Queue/CACM article fixes those. This is why I enlisted Kathie Nichols to help on the paper (and Van also read it and commented on it); this area isn't an area in which I'm fully expert. So in case of contradiction, please rely on what you see in the CACM. I'm working on a much longer, more detailed paper, but it's not done yet. Maybe someday... 24.63.191.17 (talk) 21:13, 19 December 2011 (UTC)
The ACM queue article (which appeared in the January CACM), is really the best publication to date on the bufferbloat topic, and should be read and consulted by anyone who wants to take this topic on properly.
I don't have time to do this today, and it is probably more appropriate if others undertake the surgery. I may get to it, but not anytime in the next month or two. JimGettys (talk) 18:34, 19 December 2011 (UTC)
I did update the citation to the CACM article, since the dead tree version is now available. I hope this helps.
Note that it can be used as proper citation for a number of the places where the article wants citations now.
I also note about 30 articles referencing bufferbloat in the last year courtesy of Google Scholar; dunno if any of them really try to cover the topic itself, though. JimGettys (talk) 20:39, 20 February 2012 (UTC)
- I reworked the article, splitting into sections (which might need more eyeballs), refs, exts, links etc etc and using the ACM ref more. I tagged some weaknesses at the top of the article. Widefox (talk) 17:22, 28 February 2012 (UTC)
Additional source
http://queue.acm.org/detail.cfm?id=2209336 is something we can use. I'll see when I'll have the time to fit this in myself, but I'm not sure if/when I do. Martijn Hoekstra (talk) 10:19, 21 June 2012 (UTC)