Proceedings Article10.1109/GLOCOM.2004.1378198
TCP performance under aggregate fair queueing
Wei Sun,Kang G. Shin +1 more
- 29 Nov 2004
- Vol. 3, pp 1308-1313
3
TL;DR: This paper first showed the livelock problem of FQ under the DropFront scheme, and proposed a simple solution to the problem, and then proposed a new active buffer-management scheme called ALQD+ (approximated longest queue drop), which is fairer than ALZD.
read more
Abstract: In this paper, we studied TCP performance under aggregate fair queueing (FQ). We first showed the livelock problem of FQ under the DropFront scheme, and proposed a simple solution to the problem. Then, to improve the fairness of aggregate FQ, we proposed a new active buffer-management scheme called ALQD+ (approximated longest queue drop), which is fairer than ALQD. Based on these two enhancements, via simulation, we showed that aggregate FQ provides not only excellent scalability (small scheduling and state-maintenance overheads) but also good performance, especially throughput. In addition to the simulation-based evaluation, we provided a simple performance analysis.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Active Queue Management: A Survey
TL;DR: This survey attempts to travel the trajectory of AQM research from 1993 with the first algorithm, Random Early Detection (RED), to current work in 2011, and discusses the general attributes of AQm schemes, and the design approaches taken such as heuristic, control-theoretic and deterministic optimization.
299
Communication flows in power-efficient Networks-on-Chips
Arnab Banerjee
- 01 Jan 2010
TL;DR: This thesis develops power-efficient, dynamic, packet-switched NoCs which can support onchip communication flows and proposes a modification to the link scheduling mechanism to achieve max-min fairness between flows.
Estrategia de calidad de servicio (QoS) para tráfico de aplicaciones de hospitalización domiciliaria
Ávila Berrío,Fernando Eliécer +1 more
- 01 Jan 2016
TL;DR: AQM as discussed by the authors propone un nuevo esquema de control de acceso basado en ocupacion de colas and the definicion of 3 clases de trafico, with el objetivo de ofrecer las mejores caracteristicas de QoS a las altas prioridades, mediante la adaptació de la probabilidad de rechazo del trafic de llegada.
1
References
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
Abhay Parekh,Robert G. Gallager +1 more
TL;DR: Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments.
Recommendations on Queue Management and Congestion Avoidance in the Internet
B. Braden,David D. Clark,Jon Crowcroft,Bruce S. Davie,S. Deering,Deborah Estrin,Sally Floyd,Van Jacobson,Greg Minshall,Craig Partridge,Larry L. Peterson,Kadangode K. Ramakrishnan,Scott Shenker,John Wroclawski,Lixia Zhang +14 more
- 01 Apr 1998
TL;DR: This memo presents a strong recommendation for testing, standardization, and widespread deployment of active queue management in routers, to improve the performance of today's Internet.
A generalized processor sharing approach to flow control in integrated services networks-the multiple node case
Abhay Parekh,Robert G. Gallager +1 more
- 01 May 1992
TL;DR: The authors propose the use of a packet service discipline at the nodes of the network that is based on a multiplex scheme called generalized processor sharing (GPS) that is combined with leaky bucket rate admission control to provide flexible, efficient and fair use of the links.
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
T. V. Lakshman,Upamanyu Madhow +1 more
TL;DR: Modifications that may be required both at the transport and network layers to provide good end-to-end performance over high-speed WANs are indicated.
1K
The BLUE active queue management algorithms
TL;DR: Stochastic Fair Blue is proposed and evaluated, a queue management algorithm which can identify and rate-limit nonresponsive flows using a very small amount of state information and is shown to perform significantly better than Red, both in terms of packet loss rates and buffer size requirements in the network.
Related Papers (5)
Natalia Osipova,Alberto Blanc,Konstantin Avrachenkov +2 more
- 16 Jun 2008
Kuochen Wang,Yi-Lon Chin +1 more
- 01 Dec 2001
H. Halabian,H. Saidi +1 more
- 07 Apr 2008