不交路多级互联网络的稳定性问题
Disjoint Paths Multi-stage Interconnection Networks Stability Problem
摘要:
本文强调了稳定匹配问题与多级互连网络的稳定配置问题是一致的。利用稳定匹配问题提供的方法和解决方案,解决了现有的规则Gamma多级互连网络(GMIN)、3-不相交Gamma多级互连网络(3DGMIN)和3-不相交路径循环Gamma多级互连网络(3DCGMIN)的稳定性问题。具体来说,稳定婚姻问题被用作稳定匹配的一个例子。为了证明MIN稳定,使用两种现有算法:第一算法及时生成MIN偏好列表,第二算法及时产生一组最优的切换元件(SE)对(从MIN偏好列表导出)。此外,本文还解决了最优对之间的关系问题。结果是有希望的,因为基于其稳定性的MIN的比较显示,与HZTN、QTN、DGMIN相比,ASEN、ABN、CLN、GMIN、3DCGMIN是高度稳定的。然而,在总体上比较不规则和规则MIN的稳定性时,规则MIN比不规则MIN更稳定。
英文摘要:
This research paper emphasizes that the Stable Matching problems are the same as the problems of stable configurations of Multi-stage Interconnection Networks (MIN). The authors have solved the Stability Problem of Existing Regular Gamma Multi-stage Interconnection Network (GMIN), 3-Disjoint Gamma Multi-stage Interconnection Network (3DGMIN) and 3-Disjoint Path Cyclic Gamma Multi-stage Interconnection Network (3DCGMIN) using the approaches and solutions provided by the Stable Matching Problem. Specifically Stable Marriage Problem is used as an example of Stable Matching. For MINs to prove Stable two existing algorithms are used:-the first algorithm generates the MINs Preferences List in time and second algorithm produces a set of most Optimal Pairs of the Switching Elements (SEs) (derived from the MINs Preferences List) in time. Moreover, the paper also solves the problem of Ties that occurs between the Optimal Pairs. The results are promising as the comparison of the MINs based on their stability shows that the ASEN, ABN, CLN, GMIN, 3DCGMIN are highly stable in comparison to HZTN, QTN, DGMIN. However, on comparing the irregular and regular MINs in totality upon their stability the regular MINs comes out to be more stable than the irregular MINs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。