A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
A hop by hop rate-based congestion control scheme
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient rate allocation algorithm for ATM networks providing max-min fairness
Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
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
The rate-based flow control framework for the available bit rate ATM service
IEEE Network: The Magazine of Global Internetworking
Time scale analysis scalability issues for explicit rate allocation in ATM networks
IEEE/ACM Transactions on Networking (TON)
On programmable universal mobile channels in a cellular Internet
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Experimental Evaluation of ATM Congestion Control Mechanisms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Performance and Correctness of the ATM ABR Rate Control Scheme
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
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
| Hi-index | 0.00 |
Rate based congestion management for computer communication networks has been the focus of considerable research recently. In this paper, we ezamine some of the fandamental properties of such end-to-end rate based algorithms. First is the requirement for a policy to ensure feasibility of transmission rates by sources. Feasibility implies that the capacity of any of the resources is not exceeded at any time. We show that a source policy which defers increases in the explit rate for a period of time, while allowing decreases to take effect immediately enables maintaining the requirement of feasibility. We also ezamine convergence properties of the end-to-end to rate based schemes in general, and give an upper bound on convergence time of the scheme we present here.