DocumentCode
2172619
Title
Constraint precedence in max-min fair rate allocation
Author
Tsai, Wei Kang ; Iyer, Mahadevan
Author_Institution
Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA
Volume
1
fYear
2000
fDate
2000
Firstpage
490
Abstract
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
Keywords
computational complexity; convergence of numerical methods; digital simulation; graph theory; minimax techniques; protocols; telecommunication congestion control; telecommunication networks; connection-oriented networks; constraint precedence graph; convergence time complexity; convergence time estimates; lower bound; max-min rate allocation protocols; maxmin flow control protocols; simulation results; upper bound; Constraint theory; Convergence; Ink; Intelligent networks; Propagation delay; Protocols; Steady-state; Switches; Upper bound; Virtual colonoscopy;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2000. ICC 2000. 2000 IEEE International Conference on
Conference_Location
New Orleans, LA
Print_ISBN
0-7803-6283-7
Type
conf
DOI
10.1109/ICC.2000.853367
Filename
853367
Link To Document