Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms

DOI10.1006/JAGM.1998.0970MaRDI QIDQ4228288zbMATH OpenOpenAlexFDO

Authors Yehuda Afek, Yishay Mansour, Zvi Ostfeld

Publication date 21 June 1999

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0e2a1b6a96da789692abac259454f282eb8bcba9

zbMATH Keywords

max-min fairness criteriarate-based flow-control algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1256723
• Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control
• scientific article; zbMATH DE number 1304095
• Rate control for communication networks: shadow prices, proportional fairness and stability

Cited in

(10)

• A distributed utility max-min flow control algorithm
• Convergence, stability and robustness analysis of the OFEX controller for high-speed networks
• scientific article; zbMATH DE number 1256723 (Why is no real title available?)
• scientific article; zbMATH DE number 1304095 (Why is no real title available?)
• Performance evaluation of a hierarchical rate allocation algorithm in the presence of background VBR traffic
• Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control
• Stateless Near Optimal Flow Control with Poly-logarithmic Convergence
• Why locally-fair maximal flows in client-server networks perform well
• Pricing for fairness: distributed resource allocation for multiple objectives
• Distributed max-min flow control for multi-rate overlay multicast

This page was built for publication: Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228288)