提出了一种最长队列优先的分布式迭代算法。与现有算法不同的是,该算法针对可扩展网络交换调度结构的特点,为处于最高优先级的调度器安排了两次迭代。其中的第一次迭代实现最长虚拟输出队列(VOQ)的查找,并且在最高优先级时隙之前的一个时隙完成,以缩短信号的处理时间。仿真结果表明,本算法与现有算法相比,在大流量的uniform流量模式下,延时性能与吞吐率获得了明显的提高;同时,该算法的硬件代价小,有效地实现了性能和复杂度的良好折中。
This paper represented a new distributed iteration algorithm. Different from existing algorithms, the proposed algorithm distributed the multi-iterations in sequent cell times. In the first iteration the longest queue was picked out and saved as the scheduling result in the cell time just before the highest priority cell time in order to reduce the scheduling time. The new algorithm achieved better performance on average delay and throughput under heavy load of uniform traffic model compared to the existing algorithms. Meanwhile, this proposed algorithm is fairly easy for hardware implementation.