区分服务网络的协作可调整RED算法
Coopertive adjusted red in DiffServ network
-
摘要: 文章描述了一种适用于区分服务网络的新的RED改进算法协作可调整RED算法(CARED)。算法的思想是基于令牌桶标记器的标记概率建立业务实际速率与承诺速率间的定量关系,并以这个关系动态调整下游节点中CARED的丢包概率。为了实现CARED,文章还提出了一种标记概率的计算方法基于包数的滑动窗口测量算法(NSWM)。文中通过详实的仿真实验证明了定量关系的正确性,同时验证了CARED算法不仅为区分服务提供了有效的拥塞控制功能,也保障了区分服务的不同性能要求。Abstract: This paper presents a new implementation mechanism of RED, Cooperative Adjusted RED (CARED), for the DiffServ network. It, deduces first, the quantitative relationship between the actual rate and the committed rate of services on the basis of the marking probability of token-based markers, and then adjust the dropping probability of CARED to drop packets fairly according to this relationship. It also proposes a new marking probability metering algorithm NSWM to implement CARED in DiffServ network. Lots of simulations have validated the relationship between the actual rate and the committed rate and prove the efficiency of CARED.
-
S. Floyd, K. Fall, Promoting the use of end-to-end congestion control in the Internet, IEEE/ACM Trans. on Networking, 1999, 7(4), 458-472.[2]S. Floyd, V. Jacobson, Random early detection gateways for congestion avoidance, IEEE/ACM Trans. on Networking, 1993, 1(4), 397-413.[3]B. Braden, D. Clark, et al., Recommendations on queue management and congestion avoidance in the Internet, IETF RFC2309, April 1998.[4]S. Blake, David Black, An architecture for differentiated services, Internet RFC 2475, October 1998.[5]Y. Bernet, S. Blake, A framework for differentiated services, Internet draft , Feb. 1999.[6]J. Heinanen, R. Guerin, A two rate three color marker, Internet RFC 2698, September 1999.[7]M. Mathis, J. Semke, The macroscopic behavior of the TCP congestion avoidance algorithm,Computer Communication Review, 1997, 27(3), 67-82.[8]W. Fang, N. Seddigh, B. Nandy, A time sliding window three color marker (TSWTCM). Internet RFC2859. June 2000. -
计量
- 文章访问数: 2095
- HTML全文浏览量: 82
- PDF下载量: 551
- 被引次数: 0
下载:
