Commentaires sur : An efficient network throttling algorithm http://www.devquotes.com/2010/11/24/an-efficient-network-throttling-algorithm/ devs are (s)talking. Thu, 01 Mar 2012 10:29:34 +0000 hourly 1 http://wordpress.org/?v=3.3.1 Par : softlion http://www.devquotes.com/2010/11/24/an-efficient-network-throttling-algorithm/comment-page-1/#comment-987 softlion Tue, 31 Jan 2012 10:28:34 +0000 http://www.devquotes.com/?p=170#comment-987 Did you reinvented the token bucket algorithm ? http://en.wikipedia.org/wiki/Token_bucket Did you reinvented the token bucket algorithm ?
http://en.wikipedia.org/wiki/Token_bucket

]]> Par : ed http://www.devquotes.com/2010/11/24/an-efficient-network-throttling-algorithm/comment-page-1/#comment-877 ed Wed, 30 Nov 2011 13:43:40 +0000 http://www.devquotes.com/?p=170#comment-877 Indeed, I'm gonna strike that part :) Indeed, I’m gonna strike that part :)

]]> Par : fzort http://www.devquotes.com/2010/11/24/an-efficient-network-throttling-algorithm/comment-page-1/#comment-835 fzort Mon, 11 Jul 2011 15:40:24 +0000 http://www.devquotes.com/?p=170#comment-835 Nice article, but this sounded a bit strange: "Moreover the Qt queue (QQueue) is a slow mechanism cause it has to strafe the whole list of value when calling QQueue::dequeue() (remove [0], and while there are value, move his index from i to i – 1)." QQueue is implemented as a linked list. Dequeueing is a constant-time operation; there's no data copying involved. Nice article, but this sounded a bit strange:

« Moreover the Qt queue (QQueue) is a slow mechanism cause it has to strafe the whole list of value when calling QQueue::dequeue() (remove [0], and while there are value, move his index from i to i – 1). »

QQueue is implemented as a linked list. Dequeueing is a constant-time operation; there’s no data copying involved.

]]>