An analysis of 'hot-potato' routing in a fiber optic packet switched hypercube

Two implementations of a fiber-optic packet-switched hypercube are proposed. In the first, each directed link is implemented with a fixed wavelength laser and photodetector, and all optical transmissions are wavelength multiplexed onto one or more fibers. In the second, the electronic crosspoint matrices within the nodes are eliminated by allowing each laser to be tunable over a range of log N wavelengths. Assume that a hot potato, or deflection, routing algorithm is used; as soon as a packet is received at a node, a routing decision is made and the packet is sent out. The node attempts to send the packet towards its destination. The analysis indicates that a hypercube, hot-potato routing offers essentially optimal performance for random traffic, regardless of how large the hypercube grows, and it significantly outperforms traditional shortest-path routing with buffering and flow control. A few variations, including an algorithm which gives priority to packets closer to their destinations and one which gives priority to various classes of traffic, are also proposed and analyzed.<<ETX>>

[1]  A. S. Acampora,et al.  Multihop lightwave networks: a new approach to achieve terabit capabilities , 1988, IEEE International Conference on Communications, - Spanning the Universe..

[2]  Nicholas F. Maxemchuk,et al.  Comparison of deflection and store-and-forward techniques in the Manhattan Street and Shuffle-Exchange Networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  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?.

[4]  Haim Kobrinski,et al.  HYPASS: an optoelectronic hybrid packet switching system , 1988, IEEE J. Sel. Areas Commun..

[5]  Anthony S. Acampora,et al.  Terabit lightwave networks: The multihop approach , 1987, AT&T Technical Journal.

[6]  Ted H. Szymanski,et al.  Markov chain analysis of packet-switched banyans with arbitrary switch sizes, queue sizes, link multiplicities and speedups , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[8]  M. Schwartz,et al.  Performance analysis and design of Banyan network based broadband packet switches for integrated traffic , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[9]  Roch Guérin,et al.  Input queuing of an internally nonblocking packet switch with two priority classes , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[10]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[11]  Krishnan Padmanabhan,et al.  Performance of the Direct Binary n-Cube Network for Multiprocessors , 1989, IEEE Trans. Computers.

[12]  Mischa Schwartz,et al.  A comparison of the ShuffleNet and the banyan topologies for broadband packet switches , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.