4 research outputs found
Case Tool: Fast Interconnections with New 3-Disjoint Paths MIN Simulation Module
Multi-stage interconnection networks (MIN) can be designed to achieve fault
tolerance and collision solving by providing a set of disjoint paths. In this
paper, we are discussing the new simulator added to the tool designed for
developing fault tolerant MINs. The designed tool is one of its own kind and
will help the user in developing 2 and 3-disjoint path networks. The java
technology has been used to design the tool and have been tested on different
software platform.Comment: 6 pages, 6 figure
Minimizing the Switch and Link Conflicts in an Optical Multi-stage Interconnection Network
Multistage Interconnection Networks (MINs) are very popular in switching and
communication applications. A MIN connects N inputs to N outputs and is
referred as an N \times N MIN; having size N. Optical Multistage
Interconnection Network (OMIN) represents an important class of Interconnection
networks. Crosstalk is the basic problem of OMIN. Switch Conflict and Link
Conflict are the two main reason of crosstalk. In this paper, we are
considering both problems. A number of techniques like Optical window, Improved
Window, Heuristic, Genetic, and Zero have been proposed earlier in this
research domain. In this paper, we have proposed two algorithms called Address
Selection Algorithm and Route Selection Algorithm (RSA). RSA is based on
Improved Window Method. We have applied the proposed algorithms on existing
Omega network, having shuffle-exchange connection pattern. The main
functionality of ASA and RSA is to minimize the number of switch and link
conflicts in the network and to provide conflict free routes.Comment: 9 pages, 6 figure
Disjoint Paths Multi-stage Interconnection Networks Stability Problem
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.Comment: 12 pages, 16 figure
On Stability Problems of Omega and 3-Disjoint Paths Omega Multi-stage Interconnection Networks
The research paper emphasizes that the Stable Matching problems are the same
as the problems of stable configurations of Multi-stage Interconnection
Networks (MIN). We have discusses the Stability Problems of Existing Regular
Omega Multi-stage Interconnection Network (OMIN) and Proposed 3-Disjoint Paths
Omega Multi-stage Interconnection Network (3DON) using the approaches and
solutions provided by the Stable Matching Problem. Specifically, Stable
Marriage Problem is used as an example of Stable Matching. On application of
the concept of the Stable Marriage over the MINs states that OMIN is highly
stable in comparison to 3DON