Data networks (2nd ed.)
Phantom: a simple and effective flow control scheme
Computer Networks: The International Journal of Computer and Telecommunications Networking
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Stabilization of Max-Min Fair Networks without Per-flow State
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Processor sharing flows in the internet
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
| Hi-index | 0.00 |
In this brief announcement we propose B-Neck, a max-min fair distributed algorithm that is also quiescent. As far as we know, B-Neck is the first max-min fair distributed algorithm that does not require a continuous injection of control traffic to compute the rates. When changes occur, affected sessions are asynchronously informed, so they can start the process of computing their new rate (i.e., sessions do not need to poll the network for changes). The correctness of B-Neck is formally proved, and extensive simulations are conducted. In them it is shown that B-Neck converges relatively fast and behaves nicely in presence of sessions arriving and departing.