Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Congestion control in BBN packet-switched networks
ACM SIGCOMM Computer Communication Review
Dynamic adaptive windows for high speed data networks: theory and simulations
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A theoretical analysis of feedback flow control
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Performance analysis of a feedback congestion control policy under non-negligible propagation delay
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Analysis of dynamic congestion control protocols: a Fokker-Planck approximation
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Analysis of a fluid approximation to flow control dynamics
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Analysis of a rate-based control strategy with delayed feedback
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Optimal routing in closed queuing networks
ACM Transactions on Computer Systems (TOCS)
Performance evaluation of multiple time scale TCP under self-similar traffic conditions
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on modeling and simulation of communication networks
Efficient Shaping of User-Specified QoS Using Aggregate-Flow Control
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
Non-Strict Cache Coherence: Exploiting Data-Race Tolerance in Emerging Applications
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
QoS-sensitive transport of real-time MPEG video using adaptive redundancy control
Computer Communications
| Hi-index | 0.00 |
This paper presents a distributed, end-to-end congestion control protocol for use in high-traffic packet switched networks. The network is represented as a stochastic single-server queue, with arrival rates being the control variables. A time-stamp based measure of network state called warp is defined, and it is shown to be an estimator of network utilization. Congestion is modeled explicitly using unimodal load-service rate functions, and its monotonicity property is exploited to yield characterizations of stability and optimality. A protocol based on "perfect" information is analyzed, whose prowess is then shown to be emulated by one which only uses locally computable, delayed information. The main effect of a unimodal load-service function is to induce a division of the phase space into stable and unstable regions, the optimal operating point being its "boundary." Protocols are devised for dealing with each regime separately, rate adjustment protocol being the control that guides the system to the optimal operating point. Proactive rate protocol and reactive rate protocol deal with the issue of the optimal operating point being near to the unstable zone. Protocols for handling fairness and structural perturbation augment the basic suite. The analysis is supported by simulations showing the global dynamical properties of the system.