Routing in the bidirectional shufflenet

We study the bidirectional shufflenet topology, which is obtained from the well-known (unidirectional) shufflenet by considering bidirectional links. More specifically, we define a shortest path routing algorithm, and derive the diameter and the average distance of the topology. The bidirectional shufflenet is then compared, in terms of average distance, with other variations of the perfect shuffle. Bidirectional links are very common in real networks. Possible applications of bidirectional shufflenets are wormhole routing electronic networks with back-pressure flow control, and wavelength routing optical networks. The former class of networks is considered, when virtual channels are used to prevent deadlocks. We show that four virtual channels are sufficient to avoid deadlocks in the bidirectional shufflenet, regardless of the number of nodes in the topology.

[1]  Jeffrey D. Ullman,et al.  Deadlock-Free Packet Switching Networks , 1981, SIAM J. Comput..

[2]  Jeremiah F. Hayes,et al.  WDM cross-connected star topology for the bilayered ShuffleNet , 1994 .

[3]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..

[4]  Sea Hyeon Nam Efficient Channel Allocation for a Multichannel Multihop Local Lightwave Network , 1996 .

[5]  Flaminio Borgonovo,et al.  Locally-optimal deflection routing in the Bidirectional Manhattan Network , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[6]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[7]  Thomas L. Rodeheffer Experience with Autonet , 1993, Comput. Networks ISDN Syst..

[8]  Nader Mehravari,et al.  Performance of the multichannel multihop lightwave network under nonuniform traffic , 1988, IEEE J. Sel. Areas Commun..

[9]  Mario Gerla,et al.  Congestion control in asynchronous, high-speed wormhole routing networks , 1996, IEEE Commun. Mag..

[10]  Inder S. Gopal Prevention of Store-and-Forward Deadlock in Computer Networks , 1985, IEEE Trans. Commun..

[11]  Matt W. Mutka,et al.  Priority based real-time communication for large scale wormhole networks , 1994, Proceedings of 8th International Parallel Processing Symposium.

[12]  Mario Gerla,et al.  Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..

[13]  L. Ai The supercomputer supernet testbed: a wdm based supercomputer interconnect , 1995 .

[14]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[15]  Jeffrey D. Ullman,et al.  Deadlock-free packet switching networks , 1979, SIAM J. Comput..

[16]  Richard C. Holt,et al.  Some deadlock properties of computer systems , 1971, SOSP '71.

[17]  K. Gunther,et al.  Prevention of Deadlocks in Packet-Switched Data Transport Systems , 1981 .

[18]  R. Ramaswami,et al.  Multiwavelength lightwave networks for computer communication , 1993, IEEE Communications Magazine.

[19]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[20]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[21]  P. Merlin,et al.  Deadlock Avoidance in Store-and-Forward Networks - I: Store-and-Forward Deadlock , 1980, IEEE Transactions on Communications.

[22]  M. Karol,et al.  Shuffle Net: an application of generalized perfect shuffles to multihop lightwave networks , 1991 .

[23]  Biswanath Mukherjee,et al.  Some principles for designing a wide-area WDM optical network , 1996, TNET.

[24]  B. Mukherjee,et al.  WDM-based local lightwave networks. II. Multihop systems , 1992, IEEE Network.

[25]  David Hung-Chang Du,et al.  Reverse channel augmented multihop lightwave networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[26]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[27]  M. J. Karol,et al.  ShuffleNet: an application of generalized perfect shuffles to multihop lightwave networks , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[28]  Mark J. Karol,et al.  A simple adaptive routing scheme for ShuffleNet multihop lightwave networks , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[29]  Sam Toueg,et al.  Deadlock- and livelock-free packet switching networks , 1980, STOC '80.