This paper generalizes the TCP Vegas congestion avoidance mechanism and proposes a
model to use accumulation, buffered packets of a flow inside network routers, as a …

This paper generalizes the TCP Vegas congestion avoidance mechanism and uses
accumulation, buffered packets of a flow inside network routers, as a congestion measure …

The flow/congestion control scheme of TCP is based on the sliding window mechanism. As
we demonstrate in this paper, the performance of this and other similar end-to-end flow …

Many techniques have been proposed in the last few years to address performance
degradations in end-to-end congestion control. Although these techniques require …

With the rapid development of the Internet, the end-to-end TCP congestion control becomes
insufficient in a multiple service circumstance. Many schemes have been proposed to solve …

This paper proposes a mechanism for equation-based congestion control for unicast traffic.
Most best-effort traffic in the current Internet is well-served by the dominant transport …

TCP congestion avoidance mechanisms determine methods by which a source adjusts its
window size according to network conditions. Although network calculus has been utilized to …

In mid 1980s, congestion control algorithms were implemented in TCP, realizing that the
original flow control mechanisms were not capable of protecting IP networks from severe …

Many congestion control protocols use explicit feedback from the network to achieve high
performance. Most of these either require more bits for feedback than are available in the IP …

A united framework for transport layer is proposed to improve its congestion control status
quo. Designed to be a two-layer structure, the framework utilizes measurement infrastructure …