Convergence complexity of optimistic rate based flow control algorithms (brief announcement)

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 1996, Pages 212-

  Afek, Yehuda ^a   Mansour, Yishay ^a   Ostfeld, Zvi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING;

ARBITRARY SCHEDULER; CONVERGENCE COMPLEXITY; GLOBAL MIN SCHEDULER; LOCAL MIN SCHEDULER; MAX MIN FAIRNESS CRITERIA; RATE BASED FLOW CONTROL; UPDATE RULE;

ALGORITHMS;

EID: 0029711265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/248052.248095     Document Type: Conference Paper

References (0)