networking - AIMD congestion window halving -



networking - AIMD congestion window halving -

the aimd additive increment multiplicative decrease ca algorithm halves size of congestion window when loss has been detected. experimental/statistical or theoretical evidence there suggest dividing 2 most efficient method (instead of, say, numerical value), other "intuition"? can point me publication or journal paper supports or investigates claim?

thank you

networking congestion-control

Comments

Popular posts from this blog

javascript - THREE.js reposition vertices for RingGeometry -

javascript - I need to update the text of a paragraph by inline edit -

assembly - What is the addressing mode for ld, add, and rjmp instructions? -