Universal packet routing algorithms

The packet-routing problem is examined in a network-independent context. The goal is to devise a strategy for routing that works well for a wide variety of networks. To achieve this goal, the routing problem is partitioned into two stages: a path-selection stage and a scheduling stage. In the first stage, paths for the packets are found with small maximum distance and small maximum congestion. Once the paths are fixed, both are lower bounds on the time required to deliver the packets. In the second stage, a schedule is found for the movement of each packet along its path so that no two packets traverse the same edge at the same time and the total time and maximum queue size required to route all of the packets to their destinations are minimized. The second stage is more challenging and is the focus of this study.<<ETX>>

[1]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[2]  Larry Carter,et al.  Universal classes of hash functions (Extended Abstract) , 1977, STOC '77.

[3]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[4]  Romas Aleliunas,et al.  Randomized parallel communication (Preliminary Version) , 1982, PODC '82.

[5]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[6]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[7]  Nicholas Pippenger,et al.  Parallel Communication with Limited Buffers (Preliminary Version) , 1984, FOCS.

[8]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

[9]  Charles E. Leiserson,et al.  Randomized Routing on Fat-Trees , 1989, Adv. Comput. Res..

[10]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[11]  Debasis Mitra,et al.  Randomized Parallel Communications , 1986, ICPP.

[12]  Anna R. Karlin,et al.  Parallel hashing—an efficient implementation of shared memory , 1986, STOC '86.

[13]  Abhiram G. Ranade,et al.  How to emulate shared memory (Preliminary Version) , 1987, FOCS.

[14]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[15]  Leslie G. Valiant,et al.  A logarithmic time sort for linear size networks , 1982, STOC.

[16]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[17]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[18]  Frank Thomson Leighton,et al.  Meshes with Reconfigurable Buses , 1988 .

[19]  Manfred Kunde.  Routing and Sorting on Mesh-Connected Arrays , 1988, AWOC.

[20]  Quentin F. Stout,et al.  Efficient schemes for massively fault-tolerant parallel communication , 1990 .