Study and Simulation on the Routing Queue Based on Hungary Algorithm
Shouzhi Chen · Mechanical Engineering & Automation · 2007
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.