A THEORY OF MAXMIN RATE ALLOCATION WITH MINIMAL RATE GUARANTEE

[1]  Yiwei Thomas Hou,et al.  A generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[2]  Xiaoqiang Chen,et al.  Allocating fair rates for available bit rate service in ATM networks , 1996, IEEE Commun. Mag..

[3]  Yuseok Kim,et al.  Re-examining maxmin protocols: a fundamental study on convergence, complexity, variations, and performance , 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).

[4]  Anujan Varma,et al.  Congestion management in high-speed networks , 1997 .

[5]  W. Tsai,et al.  A THEORY OF MAXMIN BOTTLENECK ORDERING 1 , 2000 .

[6]  Yuseok Kim,et al.  Minimum rate guarantee without per-flow information , 1999, Proceedings. Seventh International Conference on Network Protocols.