(Enter summary)
Abstract: In this study we explore the packet drop function in
the RED algorithm. Specifically we explore issues
involving effective maximum drop probability functions.
The main criterion was queue size behavior, but
other metrics such as throughput and delays were also
considered. Preliminary results suggest that an adaptively
changing packet drop functions make RED more
effective. Finally suggestions for the packet drop algorithm
and the insights gained are discussed.
1. (Update)
Active bibliography (related documents): More All
0.1: Steady State Analysis of the RED Gateway: Stability.. - Ohsaki, Murata (2002)
(Correct)
0.1: Best Effort Differentiated Services: Trade-off Service.. - Firoiu, Zhang (2000)
(Correct)
0.1: Steady State Analysis of Random Early Detection Gateway with.. - Ohsaki, al.
(Correct)
Similar documents based on text: More All
0.6: On the Non-Linearity of the RED Drop Function - Plasser, Ziegler, Reichl (2002)
(Correct)
0.1: Power: A First-Class Architectural Design Constraint - Mudge (2001)
(Correct)
0.0: Modeling Nonlinear Dynamics with Extended Kalman Filter TRAINED.. - Patel
(Correct)
BibTeX entry: (Update)
@misc{ patel-study,
author = "Danny Patel",
title = "A Study on the Packet Drop Function for RED",
url = "citeseer.ist.psu.edu/article/patel98study.html" }
Citations (may not include all citations):
1159
Random Early Detection Gateways for Congestion Avoidance
- Floyd, Jacobson - 1993
6
al Recommendations on Queue Management and Congestion Avoida.. (context) - et - 1997
1
Techniques for Eliminating (context) - Feng, Kandlur et al.
Documents on the same site (http://bwrc.eecs.berkeley.edu/people/Grad_Students/dpatel/Publications.htm):
Object-Oriented Design of an Embedded Communication Protocol in UML - Patel
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC