|
Volumn Part F129452, Issue , 1996, Pages 89-98
|
Convergence complexity of optimistic rate based flow control algorithms
a a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATION THEORY;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
COMPUTATIONAL METHODS;
COMPUTER SIMULATION;
CONGESTION CONTROL (COMMUNICATION);
CONVERGENCE OF NUMERICAL METHODS;
ITERATIVE METHODS;
NUMERICAL ANALYSIS;
OPTIMIZATION;
TELECOMMUNICATION LINKS;
APPROXIMATE ALGORITHMS;
CONVERGENCE COMPLEXITY;
FAIR ALLOCATION;
MAX-MIN FAIRNESS;
MODEL AND ANALYSIS;
RATE OF CONVERGENCE;
RATE-BASED FLOW CONTROL;
TRADITIONAL APPROACHES;
FLOW CONTROL;
ALGORITHMS;
ADDITION OF A SESSION;
CONVERGENCE COMPLEXITY;
DELETION OF A SESSION;
FLOW CONTROL ALGORITHMS;
MAX MIN FAIRNESS CRITERIA;
|
EID: 0029700728
PISSN: 07378017
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/237814.237837 Document Type: Conference Paper |
Times cited : (16)
|
References (13)
|