The University of Texas
· Parallel Algorithms and Architectures. T. Leighton.
Morgan Kaufmann, 1992.
Interconnection Networks Array routing 1 of 14
Packet routing problem
Given a network (modeled as a graph), assume M packets
each headed to node pi, find "best" way of routing packets
· use as few "steps" as possible, under constraint that