Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm
ACM SIGCOMM Computer Communication Review
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
TCP is max-plus linear and what it tells us on its throughput
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
End-to-end congestion control for the internet: delays and stability
IEEE/ACM Transactions on Networking (TON)
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
A Control Theoretic Analysis of RED TITLE2:
A Control Theoretic Analysis of RED TITLE2:
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
Linear stability of TCP/RED and a scalable control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Congestion control for high performance, stability, and fairness in general networks
IEEE/ACM Transactions on Networking (TON)
Why is the internet traffic bursty in short time scales?
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the long-run behavior of equation-based rate control
IEEE/ACM Transactions on Networking (TON)
Global stability of internet congestion controllers with heterogeneous delays
IEEE/ACM Transactions on Networking (TON)
Counter-intuitive throughput behaviors in networks under end-to-end control
IEEE/ACM Transactions on Networking (TON)
FAST TCP: motivation, architecture, algorithms, performance
IEEE/ACM Transactions on Networking (TON)
Equilibrium of heterogeneous congestion control: existence and uniqueness
IEEE/ACM Transactions on Networking (TON)
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
Performance effects of two-way FAST TCP
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the validity of flow-level tcp network models for grid and cloud simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Hi-index | 0.00 |
This paper develops a new model that describes the queueing process of a communication network when data sources use window flow control. The model takes into account the burstiness in sub-round-trip time (RTT) timescales and the instantaneous rate differences of a flow at different links. It is generic and independent of actual source flow control algorithms. Basic properties of the model and its relation to existing work are discussed. In particular, for a general network with multiple links, it is demonstrated that spatial interaction of oscillations allows queue instability to occur even when all flows have the same RTTs and maintain constant windows. The model is used to study the dynamics of delay-based congestion control algorithms. It is found that the ratios of RTTs are critical to the stability of such systems, and previously unknown modes of instability are identified. Packet-level simulations and testbed measurements are provided to verify the model and its predictions.