Universal continuous routing strategies

We analyze universal routing protocols, that is, protocols that can be used for any communication pattern in any network, under a stochastic model of continuous message generation. In particular, we present two universal protocols, a store-and-forward and a wormhole routing protocol, and characterize their performance by the following three parameters: the maximum message generation rate for which the protocol is stable, the expected delay of a message from generation to service, and the time the protocol needs to recover from worst-case scenarios. Both protocols yield significant performance improvements over all previously known continuous routing protocols. In addition, we present adaptations of our protocols to continuous routing in node-symmetric networks, butterflies, and meshes.

[1]  H. T. Mouftah,et al.  Survey of ATM Switch Architectures , 1995, Comput. Networks ISDN Syst..

[2]  William J. Dally.  Virtual-channel flow control , 1990, ISCA '90.

[3]  Erwin P. Rathgeb,et al.  Performance analysis of buffered Banyan networks , 1991, IEEE Trans. Commun..

[4]  Friedhelm Meyer auf der Heide,et al.  Universal algorithms for store-and-forward and wormhole routing , 1996, STOC '96.

[5]  Frank Thomson Leighton,et al.  Analysis of backoff protocols for multiple access channels , 1987, STOC '87.

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

[7]  Francesco Matera,et al.  All-optical implementations for high-capacity TDMA networks , 1993 .

[8]  John N. Tsitsiklis,et al.  The efficiency of greedy routing in hypercubes and butterflies , 1991, SPAA '91.

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

[10]  Kyungsook Y. Lee,et al.  Performance Analysis of Multibuffered Packet-Switching Networks in Multiprocessor Systems , 1990, IEEE Trans. Computers.

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

[12]  Bruce M. Maggs,et al.  Randomized Routing and Sorting on Fixed-Connection Networks , 1994, J. Algorithms.

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

[14]  David J. Aldous.  Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels , 1987, IEEE Trans. Inf. Theory.

[15]  Reinhard Lüling,et al.  On the communication throughput of buffered multistage interconnection networks , 1996, SPAA '96.

[16]  Ronald I. Greenberg,et al.  Universal wormhole routing , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[17]  Janak H. Patel.  Performance of Processor-Memory Interconnections for Multiprocessors , 1981, IEEE Transactions on Computers.

[18]  Eli Upfal,et al.  Stochastic contention resolution with short delays , 1995, STOC '95.

[19]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .