區(qū)分服務(wù)中AF類的一種調(diào)度算法
A Scheduling Algorithm for Assured Forwarding Aggregated Flows of Differentiated Services
-
摘要: 該文根據(jù)區(qū)分服務(wù)中確保轉(zhuǎn)發(fā)(Assured Forwarding,AF)類的特點(diǎn),設(shè)計(jì)了一種新的調(diào)度算法公平加權(quán)輪循(Fair、Weighted Round Robin,FWRR)算法。 FWRR是一種基于輪循、工作保持型、適于變長(zhǎng)分組的調(diào)度算法.它的實(shí)現(xiàn)簡(jiǎn)單,算法復(fù)雜度為O(1).仿真實(shí)驗(yàn)和數(shù)學(xué)分析表明,FWRR算法不僅能夠提供保證最小帶寬的服務(wù),而且能夠按比例分配剩余帶寬,適合用來(lái)調(diào)度區(qū)分服務(wù)中的AF類.Abstract: According to the characteristics of Assured Forwarding (AF) aggregated flows of Differentiated Services(DiffServ), a new scheduling algorithm, named Fair Weighted Round Robin(FWRR) is proposed. FWRR is a work-conserving round robin scheduling algorithm for variable size packets. It has a very low implementation complexity of O(1). Simulation results and mathematic analyses show that FWRR can make each queue at least occupy a minimum reserved bandwidth and share some extra bandwidth proportionally. Therefore, FWRR is a suitable scheduling algorithm for the AF flows of DiffServ.
-
計(jì)量
- 文章訪問(wèn)數(shù): 2242
- HTML全文瀏覽量: 117
- PDF下載量: 652
- 被引次數(shù): 0