Despite numerous research efforts of the past 40 years in the area of distribution expansion, a clear definition of the problem, and a truly multistage formulation that addresses practical concerns is yet to be developed. In this paper, the problem is clearly defined and analyzed from a practical point of view. A directed graph minimum edge cost network flow modeling of the problem for a truly ...

Multistage Interconnection Networks (MINs) are basic class of switch-based network architectures, which are used for constructing scalable parallel computers or for connecting networks. Multistage Interconnection Networks (MINs) are networks providing fast and efficient communication. Reliability of MINs is used to measure system’s ability to transform information from input to output. In secti...

The shuffle-exchange network is one of the most wellstudied multistage interconnection networks. Whether a (2n 1)-stage shuffle-exchange network is rearrangeable has been a challenging conjecture for some 30 years, and only recently a proof was claimed. In this article, we use the analysis method developed for EGSN networks to show that the shuffle-exchange network can be strictly nonblocking b...

The interconnection of a large number of processors and other devices to form a parallel/distributed computing system is a research area receiving a great deal of attention. One method is to use a multistage network. This paper compares two classes of multistage networks by examining two representative networks: the Generalized Cube and the Augmented Data Manipulator. The two topologies are com...

Interconnection network organization has a signiicant impact on multiprocessor system performance. However, detailed and comprehensive studies of the performance and the eeect of diierent organizations are virtually non-existent. In this study, three interconnection network organizations are evaluated as part of a cache-based shared memory multiprocessor system: tori, multistage and single-stag...

An Optical Multistage Interconnection Network (OMIN) is an important class of Interconnection Network that has large transmission capacity in the communication networks. One of the severe problems is the conflict which is caused through coupling two signals within switching elements. In this paper, we have proposed a new algorithm to minimise the number of conflicts of OMINs using the greedy gr...

Multistage Interconnection Networks (MIN) with multiple outlets are networks which can support higher bandwidth than those of nonblocking networks by passing multiple packets to the same destination. Fault recovery mechanisms are proposed for two of such networks (TBSF/PBSF) with the best use of their inherent fault tolerant capability. With these mechanisms, on-the-fly fault recovery is possib...

Purpose – The purpose of this paper is to present a model to determine which roads to be built in each stage with limited budget. Design/methodology/approach – A multistage network discrete expansion model with budget restriction is formulated and a heuristic algorithm is developed by the technique of comparing the original shortest paths and the sum of crossed shortest paths to avoid computing...

Bidirectional topologies are usually preferred over unidirectional ones. However, recent works have demonstrated that RUFT, a traffic-balancing routing algorithm on a Unidirectional Multistage Network (UMIN), can perform as well as a Bidirectional Multistage Network, but significantly reducing both implementation and operating costs. RUFT is a simplification of the k-ary n-tree topology, the mo...

We consider the problem of providing flexible, ratebased, quality of service guarantees for a particular class of multistage switch networks that includes Banyan networks. We focus on solving a type of on-line, traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the switch network. These traffic rates in general cannot be exactly achieved since th...