Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
High performance TCP in ANSNET
ACM SIGCOMM Computer Communication Review
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP
ACM SIGCOMM Computer Communication Review
IEEE/ACM Transactions on Networking (TON)
A hybrid systems modeling framework for fast and accurate simulation of data communication networks
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Part II: control theory for buffer sizing
ACM SIGCOMM Computer Communication Review
Link Buffer Sizing: A New Look at the Old Problem
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
A critique of recently proposed buffer-sizing strategies
ACM SIGCOMM Computer Communication Review
Experimental evaluation of TCP protocols for high-speed networks
IEEE/ACM Transactions on Networking (TON)
Router buffer sizing revisited: the role of the output/input capacity ratio
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Perspectives on router buffer sizing: recent results and open problems
ACM SIGCOMM Computer Communication Review
Controlled stochastic jump processes
MMES'10 Proceedings of the 2010 international conference on Mathematical models for engineering science
| Hi-index | 0.00 |
We study the interaction between the AIMD (Additive Increase Multiplicative Decrease) multi-socket congestion control and a bottleneck router with Drop Tail buffer. We consider the problem in the framework of deterministic hybrid models. First, we show that trajectories always converge to limiting cycles. We characterize the cycles. Necessary and sufficient conditions for the absence of multiple jumps in the same cycle are obtained. Then, we propose an analytical framework for the optimal choice of the router buffer size. We formulate this problem as a multi-criteria optimization problem, in which the Lagrange function corresponds to a linear combination of the average goodput and the average delay in the queue. Our analytical results are confirmed by simulations performed with MATLAB Simulink.