On a Stable Matching Problem of Hybrid Multi–stage Interconnection Networks

In this paper, we proved that stable matching problems are the same problems about stable configurations of multi-stage interconnection networks (MINs). We solved the stability problem of existing regular chained multipath cross link network using the approaches and solutions provided by the stable matching problem. Specifically we have used stable marriage problem 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 O(n²) time and second algorithm produces a set of most optimal pairs of the switching elements (SEs) (derived from the MINs preferences list) in O(n) time. The stability comparison of regular and irregular MINs concludes that fault-tolerant chained regular networks are more stable than fault-tolerant chained irregular networks.