A New WRR Algorithm Based on Ideal Packet Interval Time

In this paper we study WRR-based scheduling algorithms. According to whether packet information is used, we classify them into three classes: Queue-based WRR, Packet-based WRR and Hierarchical WRR. Based on UIWRR (Uniformly Interleaved WRR) which is a kind of Queue-based WRR, we propose a new algorithm called TIIWRR(Interleaved WRR based on ideal Time Interval) in order to overcome collision when calculate packet sending sequences using UIWRR. In this new algorithm, the concept of ideal time interval is introduced. The experimental results show that TIIWRR has better delay properties and fairness properties than UIWRR.