Instead of the increase-by-onedecrease-to-halfstrategy used in TCP Reno for congestion window adjustment, we consider the general case such that the increase value and decrease ra...
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 t...
Robert Shorten, Chris King, Fabian Wirth, Douglas ...
– Typically, NACK-based congestion control is dismissed as being not viable due to the common notion that “open-loop” congestion control is simply “difficult.” Emerging r...
In network protocol research a common goal is optimal bandwidth utilization, while still being network friendly. The drawback of TCP in networks with large bandwidth-delay product...
— Distributed media streaming, which uses multiple senders to collaboratively and simultaneously stream media content to a receiver, poses new challenges in congestion control. S...