This Article 
 Bibliographic References 
 Add to: 
Edge Congestion of Shortest Path Systems for All-to-All Communication
October 1997 (vol. 8 no. 10)
pp. 1043-1054

Abstract—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.

[1] S.H. Bokhari, Assignment Problems in Parallel and Distributed Computing.Boston: Kluwer Academic, 1987.
[2] A. Borodin and J.E. Hopcroft,"Routing, merging and sorting on parallel models of comparison," J. Computer and System Science, vol. 30, pp. 130-145, 1985.
[3] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[4] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[5] R.C. Entringer, D.E. Jackson, and D.A. Snyder, "Distance in Graphs," Czech. Math. J., vol. 26, no. 101, pp. 283-296, 1976.
[6] C.J. Glass and L.M. Ni, “The Turn Model for Adaptive Routing,” J. ACM, vol. 41, no. 5, pp. 874-902, Sept. 1994.
[7] F. Harary, Graph Theory. Addison-Wesley, 1972.
[8] S. Hinrichs, C. Kosak, D.R. O'Hallaron, T.M. Sticker, and R. Take, "An Architecture for Optimal All-to-All Personalized Communication," Proc. Symp. Parallel Algorithms and Architectures, pp. 310-319, 1994.
[9] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[10] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[11] J. Plesnik, "On the Sum of All Distances in a Graph or Digraph," J. Graph Theory, vol. 8, pp. 1-21, 1984.
[12] L.G. Valiant, “A Bridging Model for Parallel Computation,” Comm. ACM, vol. 33, no. 8, pp. 103-111, Aug. 1990.
[13] C.L. Wu and T.Y. Feng,A Tutorial on Interconnection Network for Parallel and Distributed Processing. IEEE CS Press, 1984.

Index Terms:
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 and Distributed Systems, vol. 8, no. 10, pp. 1043-1054, Oct. 1997, doi:10.1109/71.629487
Usage of this product signifies your acceptance of the Terms of Use.