Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms-Reference-Cited by-同舟云学术

Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms

Published:1999-01 Issue:1 Volume:30 Page:106-143
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Afek Yehuda,Mansour Yishay,Ostfeld Zvi

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference12 articles.

1. The rate based flow control for available bit rate atm service;Bonomi;IEEE Networks,1995

2. Data Networks;Bertsekas,1987

3. A, Charny, An Algorithm for Rate Allocation in a Packet-Switching Network with Feedback, MIT/LCS/TR-601, MIT Laboratory for Computer Science, April 1994

4. E. Gafni, The Integration of Routing and Flow Control for Voice and Data in a Computer Communication Network, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, Cambridge, MA, August 1982

5. Dynamic control of session input rates in communication networks;Gafni;IEEE Trans. Automat. Control,1984

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Distributed Algorithm to Calculate Max-Min Fair Rates Without Per-Flow State;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2019-06-19

2. A Distributed Algorithm to Calculate Max-Min Fair Rates Without Per-Flow State;P ACM MEAS ANAL COMP;2019

3. A distributed and quiescent max-min fair algorithm for network congestion control;Expert Systems with Applications;2018-01

4. Schedulers for Optimistic Rate Based Flow Control;Encyclopedia of Algorithms;2016

5. SLBN: A Scalable Max-min Fair Algorithm for Rate-Based Explicit Congestion Control;2012 IEEE 11th International Symposium on Network Computing and Applications;2012-08