Browsing by Subject "Convergence complexity"
Now showing items 1-1 of 1
-
Article
Efficiency of oblivious versus nonoblivious schedulers for optimistic, rate-based flow control
(2005)Two important performance parameters of distributed, rate-based flow control algorithms are their locality and convergence complexity. The former is characterized by the amount of global knowledge that is available to their ...