Near-Optimal Hot-Potato Routing on Trees

In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems on arbitrary tree topologies. We present two hot-potato routing algorithms, one deterministic and one randomized, whose routing times are asymptotically near-optimal (within poly-logarithmic factors from optimal). Both algorithms are distributed and greedy; so, routing decisions are made locally, and packets are advanced towards their destinations whenever possible.

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

[2]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[3]  Costas Busch,et al.  Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks , 2002, SPAA '02.

[4]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[5]  Noga Alon,et al.  Routing Permutations on Graphs Via Matchings , 1994, SIAM J. Discret. Math..

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

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

[8]  Shai Halevi,et al.  Potential Function Analysis of Greedy Hot-Potato Routing , 1994, PODC '94.

[9]  Zhensheng Zhang,et al.  Performance analysis of multihop lightwave networks with hot potato routing and distance-age-priorities , 1994, IEEE Trans. Commun..

[10]  Louxin Zhang,et al.  Optimal bounds for matching routing on trees , 1997, SODA '97.

[11]  Michael Mitzenmacher,et al.  Constant time per edge is optimal on rooted tree networks , 1996, SPAA '96.

[12]  Friedhelm Meyer auf der Heide,et al.  Shortest-Path Routing in Arbitrary Networks , 1999, J. Algorithms.

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

[14]  Rene L. Cruz,et al.  Bounds on Maximum Delay in Networks with Deflection Routing , 1995, 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]  Paul G. Spirakis,et al.  Direct routing: Algorithms and complexity , 2004, Algorithmica.

[17]  Pierre Fraigniaud,et al.  Routing in Trees , 2001, ICALP.

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

[19]  Antonios Symvonis,et al.  Lower bounds for hot-potato permutation routing on trees , 2000, SIROCCO.

[20]  Marios Mavronicolas,et al.  Direct Routing , 2003 .

[21]  Charles L. Seitz,et al.  Mosaic C: An Experimental Fine-Grain Multicomputer , 1992, 25th Anniversary of INRIA.

[22]  Ioannis Caragiannis,et al.  Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note) , 2000, Euro-Par.

[23]  Rafail Ostrovsky,et al.  Universal O(congestion + dilation + log1+εN) local control packet switching algorithms , 1997, STOC '97.

[24]  William J. Miceli,et al.  Real Time Signal Processing , 1985 .

[25]  Yuval Rabani,et al.  Distributed packet switching in arbitrary networks , 1996, STOC '96.

[26]  Mikkel Thorup,et al.  Direct routing on trees , 1998, SODA '98.

[27]  Arnold L. Rosenberg,et al.  On Bufferless Routing of Variable Length Messages in Leveled Networks , 1996, IEEE Trans. Computers.

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

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

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

[31]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

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

[33]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..

[34]  Wolfgang Karl,et al.  Euro-Par 2000 Parallel Processing , 2000, Lecture Notes in Computer Science.

[35]  Maurice Herlihy,et al.  Hard-Potato routing , 2000, STOC '00.

[36]  Noga Alon,et al.  Routing permutations on graphs via matchings , 1993, SIAM J. Discret. Math..

[37]  Antonios Symvonis,et al.  Many-to-Many Routings on Trees via Matchings , 1997, Theor. Comput. Sci..

[38]  Maurice Herlihy,et al.  Randomized greedy hot-potato routing , 2000, SODA '00.

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

[40]  Christian Scheideler,et al.  Locally efficient on-line strategies for routing packets along fixed paths , 1999, SODA '99.