一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機(jī)號碼
標(biāo)題
留言內(nèi)容
驗證碼

區(qū)分服務(wù)網(wǎng)絡(luò)的協(xié)作可調(diào)整RED算法

王茜,  隆克平,  程時端,  張潤彤

王茜, 隆克平, 程時端, 張潤彤. 區(qū)分服務(wù)網(wǎng)絡(luò)的協(xié)作可調(diào)整RED算法[J]. 電子與信息學(xué)報, 2003, 25(2): 158-163.
引用本文: 王茜, 隆克平, 程時端, 張潤彤. 區(qū)分服務(wù)網(wǎng)絡(luò)的協(xié)作可調(diào)整RED算法[J]. 電子與信息學(xué)報, 2003, 25(2): 158-163.
Wang Qian, Long Keping, Cheng Shiduan, Zhang Runtong. Coopertive adjusted red in DiffServ network[J]. Journal of Electronics & Information Technology, 2003, 25(2): 158-163.
Citation: Wang Qian, Long Keping, Cheng Shiduan, Zhang Runtong. Coopertive adjusted red in DiffServ network[J]. Journal of Electronics & Information Technology, 2003, 25(2): 158-163.

區(qū)分服務(wù)網(wǎng)絡(luò)的協(xié)作可調(diào)整RED算法

Coopertive adjusted red in DiffServ network

  • 摘要: 文章描述了一種適用于區(qū)分服務(wù)網(wǎng)絡(luò)的新的RED改進(jìn)算法協(xié)作可調(diào)整RED算法(CARED)。算法的思想是基于令牌桶標(biāo)記器的標(biāo)記概率建立業(yè)務(wù)實際速率與承諾速率間的定量關(guān)系,并以這個關(guān)系動態(tài)調(diào)整下游節(jié)點中CARED的丟包概率。為了實現(xiàn)CARED,文章還提出了一種標(biāo)記概率的計算方法基于包數(shù)的滑動窗口測量算法(NSWM)。文中通過詳實的仿真實驗證明了定量關(guān)系的正確性,同時驗證了CARED算法不僅為區(qū)分服務(wù)提供了有效的擁塞控制功能,也保障了區(qū)分服務(wù)的不同性能要求。
    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.
    • HTML全文
  • 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.
  • 加載中
計量
  • 文章訪問數(shù):  2118
  • HTML全文瀏覽量:  91
  • PDF下載量:  554
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2001-09-18
  • 修回日期:  2001-12-31
  • 刊出日期:  2003-02-19

目錄

    /

    返回文章
    返回