摘要
为了提高数据在传输过程中的性能指标和用户服务质量,针对CIOQ架构和iSLIP调度算法进行研究,提出了一种优先匹配队列信元数量达到满载的PMQF_iSLIP调度算法。算法先判断VOQ队列中的信元数量是否等于设置的最大容量,再根据判断结果执行不同的算法步骤,最终更新已完成匹配端口的优先级,在下一次匹配时,使端口具有优先匹配的权力。最后通过自己开发的数据交换仿真平台,对改进的算法进行仿真和分析,仿真结果表明,在相同的流量模型下,改进的算法减少了丢包率,增加了吞吐率。
In order to improve the performance index and user service quality during data transmission,this paper studied the CIOQ architecture and the iSLIP scheduling algorithm,and proposed a PMQF_iSLIP scheduling algorithm that prioritized the number of matching queue cells to full load.The algorithm first judged whether the number of cells in the VOQ queue was equal to the set maximum capacity,and then executed different algorithm steps according to the judgment results.And finally we updated the priority of the matched ports that have been completed.In the next matching,the port was given the priority matching authority.In the end,this paper simulated and analyzed the improved algorithm through the self-developed data exchange simulation platform.The simulation results show that:under the same traffic model,the improved algorithm reduces the packet loss rate and increases the throughput rate.
作者
冉成
苏皓
孙晔
孙洁
RAN Cheng;SU Hao;SUN Ye;SUN Jie(School of Electrical Engineering,North China University of Technology,Tangshan Hebei 063210,China;Tangshan Key Laboratory of Semiconductor Integrated Circuits,Tangshang Hebei 063210,China;China Academy of Information and Communications Technology,Beijing 100010,China)
出处
《计算机仿真》
2024年第4期325-329,417,共6页
Computer Simulation
基金
国家自然基金(51102076)。
关键词
交换结构
调度算法
信元交换
吞吐率
Switch fabric
Scheduling algorithm
Cell switching
Throughput