AdaVegas: adaptive control for TCP Vegas
暂无分享,去创建一个
[1] Raj Jain,et al. Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.
[2] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[3] Larry Peterson,et al. TCP Vegas: new techniques for congestion detection and avoidance , 1994, SIGCOMM 1994.
[4] V. Jacobson. Congestion avoidance and control , 1988, CCRV.
[5] Sally Floyd,et al. Simulation-based comparisons of Tahoe, Reno and SACK TCP , 1996, CCRV.
[6] Sally Floyd,et al. TCP Selective Acknowledgment Options , 1996, RFC.
[7] Sally Floyd,et al. TCP Selective Acknowledgement Options , 1996 .
[8] S. Floyd,et al. Tcp-friendly unicast rate-based flow control , 1997 .
[9] Steven McCanne,et al. On improving the fairness of TCP congestion avoidance , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).
[10] Frank Kelly,et al. Mathematical modeling of the Internet , 1999 .
[11] Yang Richard Yang,et al. General AIMD congestion control , 2000, Proceedings 2000 International Conference on Network Protocols.
[12] Deepak Bansal,et al. Binomial congestion control algorithms , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[13] Fernando Paganini,et al. Dynamics of TCP/RED and a scalable control , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[14] S. Low,et al. Understanding Vegas: a duality model , 2002 .
[15] Steven H. Low,et al. A duality model of TCP and queue management algorithms , 2003, TNET.