scientific article; zbMATH DE number 1256723

MaRDI QIDQ4228458zbMATH OpenFDO

Authors Yehuda Afek, Yishay Mansour, Zvi Ostfeld

Publication date 1 March 1999

zbMATH Keywords

max-min fairness criteriarate based flow-control algorithmsrate of convergence

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms
• 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

(9)

• A distributed utility max-min flow control algorithm
• Convergence, stability and robustness analysis of the OFEX controller for high-speed networks
• Dynamic control of session input rates in communication networks
• Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms
• Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control
• Stateless Near Optimal Flow Control with Poly-logarithmic Convergence
• Fairness in routing and load balancing
• Combining fairness with throughput: Online routing with multiple objectives
• Distributed max-min flow control for multi-rate overlay multicast

This page was built for publication:

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