Constraint precedence in max-min fair rate allocation

This paper proves a tight lower and upper bound for the convergence of max-min rate allocation protocols for connection-oriented networks. The theory is based on the concept of a constraint precedence graph. The analysis and simulation results show that the previously known convergence time estimates are too pessimistic.

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

[2]  Raj Jain,et al.  Congestion control with explicit rate indication , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[3]  Vijay K. Samalam,et al.  The available bit rate service for data in ATM networks , 1996 .

[4]  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.

[5]  Raj Jain,et al.  The ERICA switch algorithm for ABR traffic management in ATM networks , 1998, TNET.