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

Delphi change the assembly code of a running process -

json - Hibernate and Jackson (java.lang.IllegalStateException: Cannot call sendError() after the response has been committed) -

C++ 11 "class" keyword -