IEEE/ACM Transactions on Networking (TON)
Performance analysis of a rate-based feedback control scheme
IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Enhanced distributed explicit rate allocation for ABR services in ATM networks
IEEE/ACM Transactions on Networking (TON)
Explicit rate flow control for ABR services in ATM networks
IEEE/ACM Transactions on Networking (TON)
A predictive self-tuning fuzzy-logic feedback rate controller
IEEE/ACM Transactions on Networking (TON)
Stability and performance analysis of networks supporting elastic services
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
End-to-end congestion control for the internet: delays and stability
IEEE/ACM Transactions on Networking (TON)
Decentralized optimal traffic engineering in the internet
ACM SIGCOMM Computer Communication Review
Scalable flow control for multicast ABR services in ATM networks
IEEE/ACM Transactions on Networking (TON)
Stability and performance analysis of rate-based feedback flow controlled ATM networks
Queueing Systems: Theory and Applications
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Integrated Rate and Credit Feedback Control for ABR Service in ATM Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Performance Analysis of Rate Based Feedback Control for ATM Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
The Effect of Bottleneck Service Rate Variations on the Performance of the ABR Flow Control
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Journal of Systems and Software
Adaptive control algorithms for decentralized optimal traffic engineering in the internet
IEEE/ACM Transactions on Networking (TON)
ETERCA: an end-to-end rate control algorithm for packet switching networks
Journal of High Speed Networks
Transient analysis of a single server queue with catastrophes, failures and repairs
Queueing Systems: Theory and Applications
End-to-end optimal algorithms for integrated QoS, traffic engineering, and failure recovery
IEEE/ACM Transactions on Networking (TON)
Optimal flow control for utility-lifetime tradeoff in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Explicit congestion control based on 1-bit probabilistic marking
Computer Communications
Control mechanisms for packet audio in the internet
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Congestion control in high-speed communication networks using the Smith principle
Automatica (Journal of IFAC)
Brief Predictive congestion control of ATM networks: multiple sources/single buffer scenario
Automatica (Journal of IFAC)
Hi-index | 0.08 |
This paper gives a class of flow control algorithms for the adaptive allocation of bandwidths to virtual connections (VC) in high-speed, wide-area ATM networks. The feedback rate to the source from the network is parsimonious, with each feedback bit indicating whether the buffer at a distant switch is above or below a threshold. The service discipline at the switch is first-come-first-served. The important goal of adaptability aims to make all of the network bandwidth available to the active VCs, even though the number of such VCs is variable over a given range. Each VC has two parameters, one giving its minimum guaranteed bandwidth and the other is the weight for determining its share of the uncommitted bandwidth. Judicious selection of these parameters defines distinctive services, such as best effort and best effort with minimum bandwidth. We derive design rules for selecting the parameters of the algorithms such that the appropriate guarantees and fairness properties are exhibited in the dynamical behavior. The systematic use of “damping” in right proportion with “gain” is shown to be a powerful device for stabilizing behavior and achieving fairness. Our analyses are based on a simple analytic fluid model composed of a system of first-order delay-differential equations, which reflect the propagation delay across the network. Extensive simulations examine the following: (1) fairness, especially to start-up VCs; (2) oscillations; (3) transient behavior, such as the rate of equalization from different initial conditions; (4) disparate bandwidth allocations; (5) multiple paths with diverse propagation delays; (6) adaptability and robustness with respect to parameters; and (7) interoperability of different algorithms