wiki page
cmu tutorial

here for paper

instruction

copa is a delayed based cc. By measuring a queueing delay, it computes a expect transmit rate. Comparing the actual and expect rate, copa adjusts the cwnd by AIAD. It proves that the expect rate is an unique Nash equilibrium.

Introduction of some traditional cc algorithms(before 2012). They are the basis of modern cc algo.
Most of the ideas used now have appeared from them.

paper

test

1.a
2.b

3.c

1

printf("hello world!\n");

st=>start{"scale":1,"line-width":2,"line-length":50,"text-margin":10,"font-size":12}

Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.
the publish time is a joke. 大清亡了。