速率流控和最大最小公平分析.ppt

RED FIFO scheduling Buffer management: Probabilistically discard packets 丢弃概率是平均队长的函数 Discard Probability Average Queue Length 0 1 min_th max_th queue_len RED (cont’d) min_th： minimum threshold max_th：maximum threshold avg_len：平均队长 （滑动平均） avg_len = (1-w)*avg_len + w*sample_len Discard Probability Average Queue Length 0 1 min_th max_th queue_len W:滑动平均系数 RED (cont’d) If (avg_len min_th) ? 全部进入排队 If (avg_len max_th) ? 全部丢弃 If (avg_len = min_th and avg_len max_th) ? 依概率 P丢弃 Discard Probability (P) Average Queue Length 0 1 min_th max_th queue_len RED (cont’d) P = max_P*(avg_len – min_th)/(m