Routing without flow control

We present the first dynamic hot-potato routing algorithm that does not require any form of explicit flow control: a node may inject a message into the network (n × n mesh) whenever a link is free. In the worst case, a node may have to wait an expected &Ogr;(n) time before it has a free link. If destinations are chosen uniformly at random, this algorithm guarantees delivery in an expected &Ogr;(n) time steps. Both measures are optimal up to a constant factor.

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

[2]  Allan Borodin,et al.  Adversarial queueing theory , 1996, STOC '96.

[3]  Eli Upfal,et al.  Randomized routing with shorter paths , 1993, SPAA.

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

[5]  Uriel Feige.  Nonmonotonic phenomena in packet routing , 1999, STOC '99.

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

[7]  Christian Scheideler,et al.  From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols , 2000, SIAM J. Comput..

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

[9]  Mohamed G. Gouda.  Elements of network protocol design , 1998 .

[10]  John N. Tsitsiklis,et al.  The efficiency of greedy routing in hypercubes and butterflies , 1994, IEEE Trans. Commun..

[11]  Eli Upfal,et al.  Dynamic deflection routing on arrays (preliminary version) , 1996, STOC '96.

[12]  Frank Thomson Leighton,et al.  Greedy dynamic routing on arrays , 1995, SODA '95.

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

[14]  Michael Mitzenmacher,et al.  Bounds on the greedy routing algorithm for array networks , 1994, SPAA '94.

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

[16]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

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

[18]  Frank Thomson Leighton,et al.  Average case analysis of greedy routing algorithms on arrays , 1990, SPAA '90.

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

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

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

[22]  Baruch Schieber,et al.  Fast Deflection Routing for Packets and Worms (Extended Summary). , 1993, PODC 1993.

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