一类基于调度表的公平轮循调度算法

A Kind of Schedule Table Based Fair Round Robin Scheduling Algorithms

本文研究了一类利用时标在调度表中安排信元发送时隙的公平轮循（Fair Round Round Robin, FRR）调度算法．对其中三种算法的性能进行了分析比较．ＦＲＲ能够保证连接的带宽和时延，同时实现复杂性低于一些分组公平排队算法，例如WF^2Q+．

A kind of fair round robin(FRR) scheduling algorithms ,which schedule the cell transmission slot m the schedule table by timestampe, are studied in this paper. The performance of three algorithms belonging to ERR are analyzed and compared. ERR can guarantee the bandwidth and delay of a connection , and the implementation complexity of ERR is lower than some of packet fair queuing(PFQ) algorithms,such as WF^2Q+.