摘要
文章介绍一种无内部阻塞ATM交换结构的输入缓存模型及其缓存信元的iLQF调度算法(即迭代的最长队列优先调度算法),并具体给出该算法的实现方案。通过仿真,分析和确定了交换结构的输入缓存长度和iLQF调度算法的迭代次数对信元丢失率的影响。
In this paper, we introduce a kind of non ?blocking ATM switch fabric with input buffer and its scheduling algorithm of iLQF(cell scheduled by longest queue first out with iteration) . The iLQF' s implementation are as well given in the paper. With the simulation results, we can get the relation of buffer length and iLQF iteration with cell loss rate.
出处
《计算机与网络》
2000年第6期26-26,28,共2页
Computer & Network
