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

高級搜索

留言板

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

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

LL-DRR:一種有效的用于高速分組網(wǎng)絡(luò)的調(diào)度算法

涂曉東,  李樂民

涂曉東, 李樂民. LL-DRR:一種有效的用于高速分組網(wǎng)絡(luò)的調(diào)度算法[J]. 電子與信息學(xué)報, 2002, 24(3): 361-369.
引用本文: 涂曉東, 李樂民. LL-DRR:一種有效的用于高速分組網(wǎng)絡(luò)的調(diào)度算法[J]. 電子與信息學(xué)報, 2002, 24(3): 361-369.
Tu Xiaodong, Li Lemin. LL-DRR: An efficient scheduling algorithm for packet networks[J]. Journal of Electronics & Information Technology, 2002, 24(3): 361-369.
Citation: Tu Xiaodong, Li Lemin. LL-DRR: An efficient scheduling algorithm for packet networks[J]. Journal of Electronics & Information Technology, 2002, 24(3): 361-369.

LL-DRR:一種有效的用于高速分組網(wǎng)絡(luò)的調(diào)度算法

LL-DRR: An efficient scheduling algorithm for packet networks

  • 摘要: 該文在虧空輪循(Deficit Round Robin,DRR)算法的基礎(chǔ)上提出了一種新的適用于變長分組的調(diào)度算法低時延虧空輪循(Low Latency Deficit Round Robin,LL-DRR)。仿真和理論分析表明,在時延性能上LL-DRR比DRR有顯著的改善,并具有連接的最大時延與連接數(shù)無關(guān)的特性,可以支待實時業(yè)務(wù)。LL-DRR繼承了DRR在平均吞吐率上的公平性。LL-DRR易于實現(xiàn)且適用于高速網(wǎng)絡(luò)。
    Abstract: A novel fair queuing algorithm LL-DRR(Low Latency Deficit Round Robin)is proposed in this paper, which is based on DRR (Deficit Round Robin) algorithm and suitable to schedule variable length packets. The simulation and theoretical analysis show that the delay performance of LL-DRR is much better than DRR, and the maximum packet delay of a session in LL-DRR is independent of the number of sessions. LL-DRR can support real time service. LL-DRR inherits the fairness of DRR on average throughput. LL-DRR is simple to implement and applicable to high speed networks.
    • HTML全文
  • H.Zhang,Service disciplines for guaranteed performance service in 1packet-switching networks,Proc.IEEE,1995,83(10),1374-1396.[2]M.Shreedhar,G.Varghese,Efficient fair queuing using deficit round robin,ACM SIGCOMM.,1995.25(4),231-242.[3]A.Demers,S.Keshav,S,Shenker,Analysis and simulation of a fair queuing algorithm,ACM SIGCOMM.,1989,19(4),1-13.[4]A.K.Parekh,R.G.Gallager,A generalized processor sharing aplproach to flow control in integrated services netwvorks,The single-node case,IEEE Trans.on Networking,1993,1(3),344-357.[5]D.C.Stephens,J.C.R.Bennett,H.Zhang,Implementing scheduling algorithms in high-speed networks,IEEE J.on SAC,Special Issue on Next Generation IP Switches and Routers,1999.17(6),1145-1158.[6]J.B.Nagle,On packet switches with infinite storage,IEEE Trans.on Communicaticns,1987.COM-35(4),435-438.[7]M.Katevenis,S.Sidiropoulos,C.Courcoubetis,WVeighted round-robin cell nmltiplexing in a general-purpose ATM switch chip,IEEE J.on SAC,1991,9(8),1265-1279.[8]J.C.R.Bennett,H.Zhang,WF2Q: WVorst-case fair weighted fair queuing,San Franeisco,IEEE Infocom,California,1996,120-128.[9]北京希望電腦公司,Cisco 1OS 12 0參考庫-服務(wù)質(zhì)量優(yōu)化技術(shù),北京希望電子出版社,1999,7、59-86.
  • 加載中
計量
  • 文章訪問數(shù):  2464
  • HTML全文瀏覽量:  137
  • PDF下載量:  441
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2000-08-28
  • 修回日期:  2001-01-11
  • 刊出日期:  2002-03-19

目錄

    /

    返回文章
    返回