Stateless Near Optimal Flow Control with Poly-logarithmic Convergence

DOI10.1007/978-3-540-78773-0_50MaRDI QIDQ5458561zbMATH OpenOpenAlexFDO

Authors Baruch Awerbuch, Rohit Khandekar

Publication date 15 April 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78773-0_50

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Programming involving graphs or networks (90C35)

Recommendations

• Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms
• scientific article; zbMATH DE number 1256723
• Flow control with regularized state constraints
• scientific article; zbMATH DE number 2206640
• Stateless distributed algorithms for near optimal maximum multicommodity flows
• STOCHASTICALLY SCALABLE FLOW CONTROL
• Non-approximability and polylogarithmic approximations of the single-sink unsplittable and confluent dynamic flow problems
• Efficient controls for finitely convergent sequential algorithms
• Flow control as a stochastic optimal control problem with incomplete information
• scientific article; zbMATH DE number 1247833

Cited in

(4)

• Stateless distributed algorithms for near optimal maximum multicommodity flows
• Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control
• scientific article; zbMATH DE number 5181613 (Why is no real title available?)
• A loosely self-stabilizing protocol for randomized congestion control with logarithmic memory

This page was built for publication: Stateless Near Optimal Flow Control with Poly-logarithmic Convergence

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