摘要
在区分服务网络中提出与两色标记器协作的 RED改进算法——协作可调整 RED算法(CARED) .通过对两色令牌桶标记器的流量特性进行分析 ,获得了标记概率与服务实际速率 /承诺速率间的定量关系 ,并根据这个关系调节 CARED中的丢包概率基数 .为便于实现 CARED算法 ,还提出了一种基于包数的滑动窗口标记概率测量算法 (NSWM) .仿真实验证明了 CARED算法不仅为区分服务网络提供了有效的拥塞控制功能 ,同时保障了区分服务的性能要求和公平性 .
A new implementation mechanism of RED, cooperative adjusted RED (CARED), is presented. It cooperates with two-color marker to guarantee the fairness between different service classes in diffserv network. The main idea of this scheme is to obtain the marking probability and the quantitative relationship between the actual rate and the committed service rate, on the basis of the marking probability of two-color markers, and then adjust the dropping probability of CARED according to this relationship. To implement CARED in the diffserv network, a marking probability metering algorithm NSWM is also proposed. Lots of simulations have proved the efficiency of CARED.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2002年第3期7-11,共5页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金资助项目 (6 9972 0 0 8)
诺基亚中国研发中心合作项目