S. Doran, "RED Experience and Differential Queueing", Nanog Meeting, June 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Queue Management for Short-Lived TCP Flows in Backbone Routers - Kantawala, Turner (2002) (Correct)
....Early Discard or RED [3] RED maintains an exponentially weighted moving average of the queue length which is used to detect congestion. To make it operate robustly under widely varying conditions, one must either dynamically adjust the parameters or operate using relatively large buffer sizes [4], 5] Recently another queueing algorithm called Blue [6] was proposed to improve upon RED. Blue adjusts its parameters automatically in response to queue overflow and underflow events. Although Blue does improve over RED in certain scenarios, its parameters are also sensitive to different ....
S. Doran, "RED Experience and Differential Queueing", Nanog Meeting, June 1998.
Efficient Queue Management for TCP Flows - Kantawala, Turner (2001) (Correct)
....( all packets are dropped or marked. RED includes several parameters which must be carefully selected to get good performance. To make it operate robustly under widely varying conditions, one must either dynamically adjust the parameters or operate using relatively large buffer sizes [4, 5]. Recently another queueing algorithm called Blue [6] was proposed to improve upon RED. Blue adjusts its parameters automatically in response to queue overflow and underflow events. When the buffer overflows, the packet dropping probability is increased by a fixed increment ( and when the ....
S. Doran, "RED Experience and Differential Queueing ", Nanog Meeting, June 1998.
Queue Management for Short-Lived TCP Flows in Backbone Routers - Kantawala, Turner (2000) (Correct)
....Early Discard or RED [3] RED maintains an exponentially weighted moving average of the queue length which is used to detect congestion. To make it operate it robustly under widely varying conditions, one must either dynamically adjust the parameters or operate using relatively large buffer sizes [4], 5] Recently another queueing algorithm called Blue [6] was proposed to improve upon RED. Blue adjusts its parameters automatically in response to queue This work is supported in part by NSF Grant ANI 9714698 overflow and underflow events. Although Blue does improve over RED in certain ....
S. Doran, "RED Experience and Differential Queueing", Nanog Meeting, June 1998.
Efficient Queue Management for TCP Flows - Anshul Kantawala Anshul (2001) (Correct)
.... ) all packets are dropped or marked. RED includes several parameters which must be carefully selected to get good performance. To make it operate it robustly under widely varying conditions, one must either dynamically adjust the parameters or operate using relatively large buffer sizes [4, 5]. Recently another queueing algorithm called Blue [6] was proposed to improve upon RED. Blue adjusts its parameters automatically in response to queue overflow and underflow events. When the buffer overflows, the packet dropping probability is increased by a fixed increment ( and when the ....
S. Doran, "RED Experience and Differential Queueing", Nanog Meeting, June 1998.
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