| 基于匈牙利算法的路由排队研究及仿真 |
| |
| 引用本文： | 崔书寰,韩燮,陈守智.基于匈牙利算法的路由排队研究及仿真[J].机械工程与自动化,2007(3):39-41. |
| |
| 作者姓名： | 崔书寰 韩燮 陈守智 |
| |
| 作者单位： | 中北大学,电子与计算机科学技术学院,山西,太原,030051 |
| |
| 摘 要： | 输入排队调度算法就是通过获得路由器输入输出端口的最大匹配从而达到提高吞吐量的目的。在调度算法理论研究中可以采用二部图最大匹配的MSM和MWM算法作为各种调度算法性能的评价标准。匈牙利算法是二部图匹配的经典算法,将匈牙利算法应用到输入排队调度算法中,得出了典型算法MSM和MWM的性能仿真曲线,为未来高性能路由器的设计提供了依据。
|
| 关 键 词： | 输入排队 匈牙利算法 匹配 |
| 文章编号： | 1672-6413(2007)03-0039-03 |
| 修稿时间： | 2006-09-13 |
Study and Simulation on the Routing Queue Based on Hungary Algorithm |
| |
| CUI Shu-huan,HAN Xie,CHEN Shou-zhi.Study and Simulation on the Routing Queue Based on Hungary Algorithm[J].Mechanical Engineering & Automation,2007(3):39-41. |
| |
| Authors: | CUI Shu-huan HAN Xie CHEN Shou-zhi |
| |
| Affiliation: | School of Electronics and Computer Science and Technology,North University of China,Taiyuan 030051 ,China |
| |
| Abstract: | Input-queued scheduling algorithms are designed to match input ports to output ports as many as possible.So,MSM and MWM,which are based on bipartite graph matching,become the criteria of various scheduling algorithms theoretically.Hungary algorithm is a classical one to solve bipartite graph matching problem.In this paper,Hungary algorithm is applied to the simulation of scheduling algorithms,which produces accurate simulation result.It is the theoretical foundation to do further research on router. |
| |
| Keywords: | input-queued Hungary algorithm matching |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
