论文部分内容阅读
文章介绍一种无内部阻塞ATM交换结构的输入缓存模型及其缓存信元的iLQF调度算法(即迭代的最长队列优先调度算法),并具体给出该算法的实现方案。通过仿真,分析和确定了交换结构的输入缓存长度和iLQF调度算法的迭代次数对信元丢失率的影响。
This paper introduces an input buffer model with no internal blocking ATM switching fabric and its iLQF scheduling algorithm for cached cells (ie, the longest queue-first scheduling algorithm for iteration), and gives the implementation of the algorithm. Through the simulation, the influence of the input buffer length of the switch fabric and the number of iterations of the iLQF scheduling algorithm on the cell loss rate is analyzed and confirmed.