Convergence complexity of optimistic rate based flow control algorithms (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Phantom: a simple and effective flow control scheme
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Rate adaptation schemes in networks with mobile hosts
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Journal of High Speed Networks
Fairness comparison of FAST TCP and TCP Reno
Computer Communications
Scalability issues for distributed explicit rate allocation in ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Survey: Flow control in ATM networks: a survey
Computer Communications
On the competitiveness of AIMD-TCP within a general network
Theoretical Computer Science
| Hi-index | 0.00 |
As the speed and complexity of computer networks evolve, sharing network resources becomes increasingly important. thus, the issue of how to allocate the available bandwidth among the multitude of users needs to be addressed. Such allocation needs to be in some sense efficient and fair to different users. In this work the so-called maxmin fairness is chosen as the optimality criterion. The new distributed and asynchronous algorithm is suggested. The algorithm is shown to converge to the optimal rate allocation in a network with general topology under dynamic changes in the set of network users, individual user load and occasional route changes. An upper bound on convergence time is given. The algorithm is shown to be well-behaved in transience. Unlike previous work, the algorithm takes bandwidth consumed by feedback traffic into account. Further, an extension of the algorithm is suggested to address the problem of policing misbehaved users.