Modelling TCP congestion control dynamics in drop-tail environments

13 years 4 months ago

Download www.hamilton.ie

In this paper we study communication networks that employ drop-tail queueing and additive-increase multiplicative-decrease (AIMD) congestion control algorithms. We show that the theory of non-negative matrices may be employed to model such networks and to derive basic theorems concerning their behaviour. ᭧ 2007 Published by Elsevier Ltd.

Robert Shorten, Chris King, Fabian Wirth, Douglas

Real-time Traffic

AUTOMATICA 2007 | Communication Networks | Congestion Control | Non-negative Matrices |

claim paper

» Random Early Marking

» Coordinated TCP Westwood congestion control for multiple paths over wireless networks

» Achieving network stability and user fairness through admission control of TCP connections

» TCP behavior in sub packet regimes

» Evaluation of Advanced TCP Stacks in the iSCSI Environment using Simulation Model

» A mathematical model of the Skype VoIP congestion control algorithm

» Performance of Quantized Congestion Notification in TCP Incast Scenarios of Data Centers

» Analytical Model of TCP with Enhanced Recovery Mechanism for Wireless Environments

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2007
Where	AUTOMATICA
Authors	Robert Shorten, Chris King, Fabian Wirth, Douglas J. Leith

Comments (0)

Sciweavers

Modelling TCP congestion control dynamics in drop-tail environments

AUTOMATICA 2007 | Communication Networks | Congestion Control | Non-negative Matrices |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers