Hot-Potato Routing on Multi-Dimensional Tori

We consider the hot-potato routing problem. The striking feature of this form of packet routing is that there are no buffers at the nodes. Thus packets are always moving.

[1]  Albert G. Greenberg,et al.  Sharp approximate models of deflection routing in mesh networks , 1993, IEEE Trans. Commun..

[2]  Albert G. Greenberg,et al.  Deflection routing in hypercube networks , 1992, IEEE Trans. Commun..

[3]  Satish Rao,et al.  Hot-potato routing on processor arrays , 1993, ACM Symposium on Parallelism in Algorithms and Architectures.

[4]  Bruce E. Hajek,et al.  Performance of shuffle-like switching networks with deflection , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[5]  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.

[6]  Uriel Feige,et al.  Exact analysis of hot-potato routing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[7]  Anthony S. Acampora,et al.  Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[8]  Ted H. Szymanski.  An analysis of 'hot-potato' routing in a fiber optic packet switched hypercube , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[9]  Thomas G. Robertazzi,et al.  Sharp Approximate Models of Deflection Routing in Mesh Networks , 1993 .