ESSDRR调度算法的性能仿真与分析

Analysis and simulation of ESSDRR

鉴于已有的分组调度算法难以同时满足良好的QoS保证特性和算法的低复杂性,结合WF2Q和DRR两种算法的优点,提出了一种基于均匀服务序列的DRR算法———ESSDRR(EvenServiceSequence-basedDeficitRound-Robin)。为了评价其优劣性,在同一仿真条件下利用NS2对该算法以及三个类似算法做了大量仿真实验,主要考察并比较了各算法的端到端时延、短期吞吐率等性能指标。实验结果显示,ESSDRR具有良好的公平性、低时延特性及较低的复杂性。

The existing algorithms usually fail to satisfy the QoS guarantee features and the low complexity. An algorithm called Even Service Sequence-based Deficit Round-Robin （ESSDRR） was proposed, which inherits merits from both WF2Q and DRR. To estimate performance of ESSDRR in end-to-end delay and short-term throughput property, extensive simulation experiments have been done using NS2 in the same condition. And comparison has been made among ESSDRR and other three well-known scheduling schemes. Results show that ESSDRR has ~ood OoS ~aarantee property and low time complexity.