Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
Feedback control of congestion in packet switching networks: the case of a single congested node
IEEE/ACM Transactions on Networking (TON)
Robust adaptive control
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)
Explicit rate flow control for ABR services in ATM networks
IEEE/ACM Transactions on Networking (TON)
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
IEEE/ACM Transactions on Networking (TON)
TCP performance over end-to-end rate control and stochastic available capacity
IEEE/ACM Transactions on Networking (TON)
ACM SIGCOMM Computer Communication Review
Adaptive Control
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
Performance of TCP congestion control with explicit rate feedback
IEEE/ACM Transactions on Networking (TON)
Adaptive congestion protocol: A congestion control protocol with learning capability
Computer Networks: The International Journal of Computer and Telecommunications Networking
Processor sharing flows in the internet
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Congestion control in high-speed communication networks using the Smith principle
Automatica (Journal of IFAC)
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
Adaptive congestion protocol: A congestion control protocol with learning capability
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Many congestion control protocols have been recently proposed in order to alleviate the problems encountered by TCP in high-speed networks and wireless links. Protocols utilizing an architecture that is in the same spirit as the ABR service in ATM networks require estimates of the effective number of users utilizing each link in the network to maintain stability in the presence of delays. In this paper, we propose a novel estimation algorithm that is based on online parameter identification techniques and is shown through analysis and simulations to converge to the effective number of users utilizing each link. The algorithm does not require maintenance of per-flow states within the network or additional fields in the packet header, and it is shown to outperform previous proposals that were based on pointwise division in time. The estimation scheme is designed independently from the control functions of the protocols and is thus universal in the sense that it operates effectively in a number of congestion control protocols. It can thus be successfully used in the design of new congestion control protocols. In this paper, to illustrate its universality, we use the proposed estimation scheme to design a representative set of Internet congestion control protocols. Using simulations, we demonstrate that these protocols satisfy key design requirements. They guide the network to a stable equilibrium that is characterized by high network utilization, small queue sizes, and max-min fairness. In addition, they are scalable with respect to changing bandwidths, delays, and number of users, and they generate smooth responses that converge quickly to the desired equilibrium.