Bounds and Analysis Techniques for Greedy Hot-Potato Routing

In this chapter we consider a type of packet routing known as hot-potato routing. In hot-potato routing there is no intermediate storage for the packets (messages) that are on their way to their destinations, which is an important feature for communication networks that are based on optical hardware and for which the messages are composed of beams of light. In particular we consider a “practical” mode of routing, known as greedy routing. In greedy routing, unless some local congestion forbids it, an intermediate network node always attempts to send packets towards their destinations. We present several algorithms and analysis methods that were recently suggested by the author and his colleagues for greedy routing, along with some negative results by means of a general lowerbound.

[1]  Uriel Feige,et al.  Observations on hot potato routing , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[2]  Friedhelm Meyer auf der Heide,et al.  Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks , 1995, ESA.

[3]  Burton J. Smith.  Architecture And Applications Of The HEP Multiprocessor Computer System , 1982, Optics & Photonics.

[4]  Allan Borodin,et al.  Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..

[5]  Shai Halevi,et al.  Potential Function Analysis of Greedy Hot-Potato Routing , 1998, Theory of Computing Systems.

[6]  Assaf Schuster,et al.  A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms , 1996, ESA.

[7]  Assaf Schuster,et al.  Hot-Potato Algorithms for Permutation Routing , 1995, IEEE Trans. Parallel Distributed Syst..

[8]  Frank Thomson Leighton,et al.  Minimal Adaptive Routing on the Mesh with Bounded Queue Size , 1996, J. Parallel Distributed Comput..

[9]  Zhensheng Zhang,et al.  Performance analysis of multihop lightwave networks with hot potato routing and distance-age-priorities , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[10]  Oj Onno Boxma,et al.  Teletraffic Analysis and Computer Performance Evaluation , 1988 .

[11]  Assaf Schuster,et al.  Hot Potato Worm Routing via Store-and-Forward Packet Routing , 1995, J. Parallel Distributed Comput..

[12]  Baruch Schieber,et al.  Fast deflection routing for packets and worms , 1993, PODC '93.

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

[14]  Allan Borodin,et al.  Deterministic Many-to-Many Hot Potato Routing , 1997, IEEE Trans. Parallel Distributed Syst..

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

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

[17]  P. Baran,et al.  On Distributed Communications Networks , 1964 .

[18]  Hussein G. Badr,et al.  An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies , 1989, IEEE Trans. Computers.

[19]  Rene L. Cruz,et al.  Bounds on Maximum Delay in Networks with Deflection Routing , 1995, IEEE Trans. Parallel Distributed Syst..

[20]  Charles L. Seitz,et al.  A framework for adaptive routing in multicomputer networks , 1989, CARN.

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

[22]  Boaz Patt-Shamir,et al.  Many-to-one packet routing on grids , 1995, STOC '95.

[23]  Assaf Schuster,et al.  Randomized Single-Target Hot-Potato Routing , 1997, J. Algorithms.

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

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