Wait-Free Deflection Routing of Long Messages

In order to obtain the lowest possible latency, routing algorithms should try to avoid a message waiting for resources (network links) blocked by other messages or multiplexing of more messages over one physical channel. This requirement becomes especially important in the case of long messages. The only type of protocols able to guarantee waiting free routing under heavy load are algorithms based on deflection (also called nonminimal adaptive or hot potato) routing. This paper deals with problems connected with the use of deflection algorithms. In contrast to the case of nonadaptive or partially (e.g., minimal) adaptive routing, it is very infrequent that an unrestricted deflection routing becomes deadlocked and, similarly, livelock is not a serious problem. On the other hand, there is another phenomenon, called a deflection jam, that limits throughput of deflection algorithms used to route long messages. It has been observed for many deflection heuristics, interconnection network topologies, and both virtual cut-through and wormhole routing. A deflection jam is a sudden and persistent saturation of a network which sometimes occur, after a very long period of undisturbed communication. This paper describes events that trigger this saturation which suggest ways to design improved and stable deflection routing algorithms.

[1]  Béla Bollobás,et al.  Random Graphs , 1985 .

[2]  J. Spencer,et al.  EVOLUTION OF THE n-CUBE , 1979 .

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

[4]  Anna R. Karlin,et al.  On the fault tolerance of the butterfly , 1994, STOC '94.

[5]  Arun K. Somani,et al.  Rearrangeable Circuit-Switched Hypercube Architecture for Routing Permutations , 1993, J. Parallel Distributed Comput..

[6]  János Komlós,et al.  Largest random component of ak-cube , 1982, Comb..

[7]  Friedhelm Meyer auf der Heide,et al.  A Packet Routing Protocol for Arbitrary Networks , 1995, STACS.

[8]  Alan M. Frieze,et al.  Optimal construction of edge-disjoint paths in random graphs , 1994, SODA '94.

[9]  Thomas R. Mathies Percolation theory and computing with faulty arrays of processors , 1992, SODA '92.

[10]  Lawrence Snyder,et al.  The Chaos Router , 1994, IEEE Trans. Computers.

[11]  Maxemchuk The Manhattan street network , 1985 .

[12]  Hisao Tamaki,et al.  Routings for Involutions of a Hypercube , 1994, Discret. Appl. Math..

[13]  Ted H. Szymanski,et al.  On the Permutation Capability of a Circuit-Switched Hypercube , 1989, International Conference on Parallel Processing.

[14]  H. Kesten The critical probability of bond percolation on the square lattice equals 1/2 , 1980 .

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

[16]  Sudhakar Yalamanchili,et al.  A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[17]  Ted H. Szymanski,et al.  On the Permutation Capability of Multistage Interconnection Networks , 1987, IEEE Transactions on Computers.

[18]  José D. P. Rolim,et al.  Bisecting De Bruijn and Kautz Graphs , 1998, Discret. Appl. Math..

[19]  Alan M. Frieze,et al.  Existence and Construction of Edge-Disjoint Paths on Expander Graphs , 1994, SIAM J. Comput..

[20]  Andreas Schwill Shorest Edge-Disjoint Paths in Graphs , 1989, STACS.

[21]  Andrew A. Chien,et al.  Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing , 1997, IEEE Trans. Parallel Distributed Syst..

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

[23]  Nicholas F. Maxemchuk,et al.  Routing in the Manhattan Street Network , 1987, IEEE Trans. Commun..

[24]  José Duato,et al.  A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..

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

[26]  Anna Lubiw,et al.  Counterexample to a Conjecture of Szymanski on Hypercube Routing , 1990, Inf. Process. Lett..

[27]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.