S. Doran. RED Experience and Differentiated Queueing. In NANOG Meeting, June 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
BLUE: A New Class of Active Queue Management Algorithms - Feng, Kandlur, Saha, Shin (1999) (79 citations) (Correct)
....determining the severity of congestion. As a result, RED requires a wide range of parameters to operate correctly under different congestion scenarios. While RED can achieve an ideal operating point, it can only do so when it has a sufficient amount of buffer space and is correctly parameterized [5, 29]. In light of the above observation, this paper proposes BLUE, a fundamentally different active queue management algorithm which uses packet loss and link utilization history to manage congestion. BLUE maintains a single probability, which it uses to mark (or drop) packets when they are queued. ....
S. Doran. RED Experience and Differentiated Queueing. In NANOG Meeting, June 1998.
The BLUE Active Queue Management Algorithms - Feng, Shin, Kandlur, Saha (2002) (5 citations) (Correct)
....determining the severity of congestion. As a result, RED requires a wide range of parameters to operate correctly under different congestion scenarios. While RED can achieve an ideal operating point, it can only do so when it has a sufficient amount of buffer space and is correctly parameterized [6, 34]. In light of the above observation, we propose a fundamentally different active queue management algorithm, called BLUE, which uses packet loss and link utilization history to manage congestion. BLUE maintains a single probability, which it uses to mark (or drop) packets when they are queued. If ....
S. Doran. RED Experience and Differentiated Queueing. In NANOG Meeting, June 1998.
Improving Internet Congestion Control And Queue Management.. - Feng (1999) (11 citations) (Correct)
....determining the severity of congestion. As a result, RED requires a wide range of parameters to operate correctly under different congestion scenarios. While RED can achieve an ideal operating point, it can only do so when it has a sufficient amount of buffer space and is correctly parameterized [15, 65]. In light of the above observation, this chapter proposes a fundamentally different active queue management algorithm, called BLUE, which uses packet loss and link utilization history to manage congestion. BLUE maintains a single probability, which it uses to mark (or drop) packets when they 42 ....
S. Doran. RED Experience and Differentiated Queueing. In NANOG Meeting, June 1998.
BLUE: A New Class of Active Queue Management Algorithms - Dilip, Kandlur, Saha, Shin (1999) (3 citations) (Correct)
....determining the severity of congestion. As a result, RED requires a wide range of parameters to operate correctly under different congestion scenarios. While RED can achieve an ideal operating point, it can only do so when it has a sufficient amount of buffer space and is correctly parameterized [5, 29]. In light of the above observation, this paper proposes BLUE, a fundamentally different active queue management algorithm which uses packet loss and link utilization history to manage congestion. BLUE maintains a single probability, which it uses to mark (or drop) packets when they are queued. ....
S. Doran. RED Experience and Differentiated Queueing. In 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