Feedback control of congestion in packet switching networks: the case of a single congested node
IEEE/ACM Transactions on Networking (TON)
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Robust adaptive control
Self-similarity in World Wide Web traffic: evidence and possible causes
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Time scale analysis scalability issues for explicit rate allocation in ATM networks
IEEE/ACM Transactions on Networking (TON)
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
ACM SIGCOMM Computer Communication Review
An efficient rate allocation algorithm for ATM networks providing max-min fairness
Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
A Linear Dynamic Model for Design of Stable Explicit-Rate ABR Control Schemes
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A Linear Control Approach to Explicit Rate Feedback 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
An ABR Feedback Control Scheme with Tracking
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Congestion control for high performance, stability, and fairness in general networks
IEEE/ACM Transactions on Networking (TON)
Performance of TCP congestion control with explicit rate feedback
IEEE/ACM Transactions on Networking (TON)
Why flow-completion time is the right metric for congestion control
ACM SIGCOMM Computer Communication Review
Processor sharing flows in the internet
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
A new estimation scheme for the effective number of users in internet congestion control
IEEE/ACM Transactions on Networking (TON)
Improving the performance of reliable transport protocols in mobile computing environments
IEEE Journal on Selected Areas in Communications
Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
A Q-learning model-independent flow controller for high-speed networks
ACC'09 Proceedings of the 2009 conference on American Control Conference
Nash Q-learning multi-agent flow control for high-speed networks
ACC'09 Proceedings of the 2009 conference on American Control Conference
Wireless loss-tolerant congestion control protocol based on dynamic AIMD theory
IEEE Wireless Communications
Explicit congestion control based on 1-bit probabilistic marking
Computer Communications
A new estimation scheme for the effective number of users in internet congestion control
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
There is strong evidence that the current implementation of TCP will perform poorly in future high-speed networks. To address this problem many congestion control protocols have been proposed in literature which, however, fail to satisfy key design requirements of congestion control protocols, as these are outlined in the paper. In this work we develop an adaptive congestion protocol (ACP) which is shown to satisfy all the design requirements and thus outperform previous proposals. Extensive simulations indicate that the protocol is able to guide the network to a stable equilibrium which is characterized by max-min fairness, high-utilization, small queue sizes and no observable packet drops. In addition, it is found to be scalable with respect to changing bandwidths, delays and number of users utilizing the network. The protocol also exhibits nice transient properties such as smooth responses with no oscillations and fast convergence. In realistic traffic scenarios comprising of a small number of long flows and a large number of short flows, ACP outperforms both TCP and XCP, even in the presence of random packet losses. ACP does not require maintenance of per flow states within the network and utilizes an explicit multi-bit feedback signalling scheme. To maintain stability it implements at each link a novel estimation algorithm which estimates the number of flows utilizing the link. Using a simple network model, we show analytically the effectiveness of the estimation algorithm. We use the same model to generate phase portraits which demonstrate that the ACP protocol is stable for all delays.