Evaluation of FIFO-based buffer management algorithms for TCP over guaranteed frame rate service

O Elloumi, H Afifi - … .'Meeting the Challenges of Deploying the …, 1998 - ieeexplore.ieee.org
We study the issue of providing rate guarantees to TCP connections. Different buffer
management algorithms for FIFO based scheduling are evaluated by means of analysis and …

A novel fair bandwidth allocation algorithm for TCP window control

F Peng, VCM Leung - Conference Proceedings of the 2003 …, 2003 - ieeexplore.ieee.org
Without appropriately fair buffer management in the network, TCP encounters inherent
unfairness towards connections with long round-trip times. The paper proposes a …

Comparisons of packet scheduling algorithms for fair service among connections

T Matsuo, G Hasegawa, M Murata… - … Workshop. IWS99.(Cat …, 1999 - ieeexplore.ieee.org
We investigate the performance of TCP under several packet scheduling algorithms at the
router. Our main focus is how fair service can be provided for elastic applications sharing the …

Buffer sizing for elastic traffic

J Augé, J Roberts - 2006 2nd Conference on Next Generation …, 2006 - ieeexplore.ieee.org
Two areas of active research are likely to have a major impact on the future performance of
the Internet. These are firstly, the evaluation of the buffer size required to ensure fair, stable …

Approximate fair bandwidth allocation: A method for simple and flexible traffic management

R Pan, B Prabhakar, F Bonomi… - 2008 46th Annual …, 2008 - ieeexplore.ieee.org
The Internet architecture uses congestion avoidance mechanisms implemented in the
transport layer protocol like TCP to provide good service under heavy load. If network nodes …

A simulation study of differential fair buffer allocation

V Bonin, F Cerdán, O Casals - … of the IEEE Conference on High …, 2000 - ieeexplore.ieee.org
The guaranteed frame rate service (GFR) is viewed as the most promising ATM service for
carrying TCP/IP traffic over large distances. We study the behavior of differential fair buffer …

A note on fair queueing and best-effort service in the Internet

O Altintas, Y Atsumi, T Yoshida - 1999 Internet Workshop …, 1999 - ieeexplore.ieee.org
Providing fair and stable service to competing best-effort flows over a bottleneck router/link
pair is a major challenge. Recently there is growing interest in providing isolation and …

Comparisons of packet scheduling algorithms for fair service among connections on the Internet

G Hasegawa, T Matsuo, M Murata… - … IEEE INFOCOM 2000 …, 2000 - ieeexplore.ieee.org
We investigate the performance of TCP under three representatives of packet scheduling
algorithms at the router. Our main focus is to investigate how fair service can be provided for …

Early fair drop: a new buffer management policy

J Bruno, B Ozden, A Silberschatz… - … and Networking 1999, 1998 - spiedigitallibrary.org
In this paper, we investigate the effectiveness of packet-drop mechanisms in conjunction
with fair queuing link scheduling and hierarchical link sharing. Under fair queuing, the link …

Active queue control scheme for achieving approximately fair bandwidth allocation

T Miyamura, T Kurimoto, K Nakagawa… - … . ICC 2002 (Cat. No …, 2002 - ieeexplore.ieee.org
We propose a buffer management mechanism, called V-WFQ (virtual weighted fair
queueing), for achieving approximately fair bandwidth allocation with a small amount of …