On a Class of Multistage Interconnection Networks

  • Authors:
  • Chuan-Lin Wu; Tse-Yun Feng

  • Affiliations:
  • Department of Computer Science, Wright State University;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1980

Quantified Score

Hi-index 15.05

Visualization

Abstract

A baseline network and a configuration concept are introduced to evaluate relationships among some proposed multistage interconnection networks. It is proven that the data manipulator (modified version), flip network, omega network, indirect binary n-cube network, and regular SW banyan network (S = F = 2) are topologically equivalent. The configuration concept facilitates developing a homogeneous routing algorithm which allows one-to-one and one- to-many connections from an arbitrary side of a network to the other side. This routing algorithm is extended to full communication which allows connections between terminals on the same side of a network. A conflict resolution scheme is also included. Some practical implications of our results are presented for further research.