期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：7
出版社：S.S. Mishra
摘要：In this paper, the Maximal Node Containing Matching (MNCM) , is a latest set of matching algorithms that achieve 100% throughput with no speedup. The MNCM policies only need to include ports whose weight (backlog) are above a threshold in the matching rather than finding a matching with maximum total weight. This simplified requirement enables to introduce a new matching algorithm, Maximal First Matching (MFM) , with O(N2.5) complexity. It shows that MFM is a low complexity algorithm with good delay performance. It also compare the performance of MFM with other matching scheduling algorithms (LQF and MSM), and the simulation results illustrate that MFM provides the best delay-throughput performance
关键词：Maximal Node Containing Matching; Maximal First Matching; threshold; no speedup
