Issue No.10 - October (1997 vol.8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.629487
<p><b>Abstract</b>—The problem of choosing a static shortest-path system that minimizes maximum edge congestion in a network is studied. Bounds based on parameters, such as diameter, bisection width, and average distance, are derived and conditions for producing uniform congestion on all edges are explored. Trees are shown to have maximum congestion on edges that are incident to a centroid node. Cartesian product graphs, which generalize multidimensional meshes, are shown to satisfy several closure properties and a generic factor-routing scheme is defined and shown to be optimal in many cases.</p>
Cartesian product graphs, centroid, congestion, distance matrix, graph embedding, mapping problem, networks, oblivious routing, shortest paths.
Charles M. Fiduccia, Paul J. Hedrick, "Edge Congestion of Shortest Path Systems for All-to-All Communication", IEEE Transactions on Parallel & Distributed Systems, vol.8, no. 10, pp. 1043-1054, October 1997, doi:10.1109/71.629487