An active queue management scheme for Internet congestion control and its application to differentiated services
暂无分享,去创建一个
Rong Zheng | Jennifer C. Hou | Ling Su | J. Hou | Rong L. Zheng | Ling Su
[1] T. V. Lakshman,et al. SRED: stabilized RED , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[2] Sally Floyd,et al. TCP and explicit congestion notification , 1994, CCRV.
[3] Rong Zheng,et al. How to make assured service more assured , 1999, Proceedings. Seventh International Conference on Network Protocols.
[4] Robert Tappan Morris,et al. Dynamics of random early detection , 1997, SIGCOMM '97.
[5] Donald F. Towsley,et al. Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.
[6] SemkeJeffrey,et al. The macroscopic behavior of the TCP congestion avoidance algorithm , 1997 .
[7] K. K. Ramakrishnan,et al. Gateway Congestion Control Survey , 1991, RFC.
[8] Sally Floyd,et al. Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic , 1991, CCRV.
[9] Archan Misra,et al. The window distribution of idealized TCP congestion avoidance with variable packet loss , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[10] Wu-chang Fengy,et al. BLUE: A New Class of Active Queue Management Algorithms , 1999 .
[11] NetworksAllyn Romanow,et al. Dynamics of Tcp Traac over Atm Networks , 1994 .
[12] Juan-Antonio Ibanez,et al. Preliminary Simulation Evaluation of an Assured Service , 1998 .
[13] Matthew Mathis,et al. The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.
[14] FloydSally. Connections with multiple congested gateways in packet-switched networks part 1 , 1991 .
[15] A. L. Narasimha Reddy,et al. Realizing throughput guarantees in a differentiated services network , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.
[16] Allison Mankin,et al. Random drop congestion control , 1990, SIGCOMM '90.
[17] Leandros Tassiulas,et al. Fair bandwidth sharing among adaptive and non-adaptive flows in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[18] B. Barden. Recommendations on queue management and congestion avoidance in the Internet , 1998 .
[19] David D. Clark,et al. Explicit allocation of best-effort packet delivery service , 1998, TNET.
[20] Vern Paxson,et al. Measurements and analysis of end-to-end Internet dynamics , 1997 .
[21] Scott Shenker,et al. Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.
[22] Sally Floyd,et al. Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.
[23] Eman Salaheddin Hashem,et al. Analysis of Random Drop for Gateway Congestion Control , 1989 .
[24] Christophe Diot,et al. Simple performance models of differentiated services schemes for the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).