A distributed and quiescent max-min fair algorithm for network congestion control

作者：

Highlights：

• B-Neck is the first quiescent max-min fair distributed optimization algorithm.

• B-neck quiescence can be advantageous in energy efficiency scenarios.

• B-Neck correctness and quiescence are formally proved.

• A tight upper bound on the convergence time of B-Neck is formally proved.

• Experimental results encourage its use in anticipatory congestion control systems.

摘要

•B-Neck is the first quiescent max-min fair distributed optimization algorithm.•B-neck quiescence can be advantageous in energy efficiency scenarios.•B-Neck correctness and quiescence are formally proved.•A tight upper bound on the convergence time of B-Neck is formally proved.•Experimental results encourage its use in anticipatory congestion control systems.

论文关键词：Max-min fair,Distributed optimization,Proactive algorithm,Quiescent algorithm,Network congestion control

论文评审过程：Received 30 January 2017, Revised 19 August 2017, Accepted 9 September 2017, Available online 12 September 2017, Version of Record 27 September 2017.

论文官网地址：https://doi.org/10.1016/j.eswa.2017.09.015