Abstract
Let G be a Cayley graph on n vertices with degree D. We effectively compute a vertex optimal integral uniform concurrent flow in G and develop an offline packet routing algorithm for routing n(n−l) packets. The number of communication steps to route all packets to their destination is shown to be within a multiplicative factor of D from the optimum. Our algorithm can be implemented online in many existing parallel networks, so that the number of communication steps is within a multiplicative factor D from the optimum. Slight variations of our algorithm give rise to effective packet routing algorithms in perfect shuffles and deBruijn graphs. The model of computation required for our routing strategy may be assumed to be either MIMD or SIMD, as our online solutions only require the execution of the same instruction at the processors while routing.
Research of the second author was supported by the A. v. Humboldt-Stiftung while he was visiting at the Institut für diskrete Mathematik, Bonn; and by the U.S. Office of Naval Research under the contract N-0014-91-J-1385.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chartrand, G., and Lesniak, L., Graphs and Digraphs, Wadsworth and Books/Cole Mathematics Series, 1986.
Even, S., Itai, A., and Shamir, A., On the complexity of timetable and multicommodity flow problems, SIAM J. Computing 5(1976), 691–703.
Ford, L. R., and Fulkerson, D. R., Flows in Networks, Princeton University Press, Princeton, 1962.
Hu, T. C., Multi-commodity network flows, J. ORSA 11(1963), 344–360.
Johnson, L., and Ho, C. T., Optimal broadcasting and personalized communication in hypercubes, IEEE Trans. Comput. 38(1989), 1249–1268.
Karmarkar, N., A new polynomial time algorithm for linear programming, Combinatorica 4(1984), 373–395.
Matula, D. W., Concurrent flow and concurrent connectivity in graphs, in: Graph Theory and its Applications to Algorithms and Computer Science, eds. Alavi, Y., et al., Wiley, New York, 1985, 543–559.
Papadimitriou, H., and Stieglitz, K., Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewdod-Cliffs, N. J., 1982.
Raghavan, P., Probabilistic construction of deterministic algorithms: approximating packing integer programs, Proc. 27th IEEE Symp. on the Foundations of Computer Sci., 1986, 10–18.
Saad, R., Complexity of forwarding index problem, Universite de Paris-Sud, Lab. de Recherche en Informatique, Rapport No. 648, 1991.
Saad, Y., and Schultz, M. H., Data communication in hypercubes, J. Parallel and Distributed Computing 6(1989), 115–135.
Shahrokhi, F., and Matula, D. W., The maximum concurrent flow problem, J. Assoc. for Computing Machinery 37(1990), 318–334.
Shahrokhi, F., and Székely, L. A., Effective lower bounds for crossing number, bisection width and balanced vertex separators in terms of symmetry, in: Integer Programming and Combinatorial Optimization, Proceedings of a Conference held at Carnegie Mellon University, May 25–27, 1992, by the Mathematical Programming Society, eds. E. Balas, G. Cournejols, R. Kannan, 102–113, CMU Press, 1992.
Shahrokhi, F., and Székely, L. A., Formulae for the optimal congestion of the uniform concurrent multicommodity flow, submitted.
Ullman, J. D., Computational Aspects of VLSI, Computer Science Press, Rockville, Maryland, 1984.
White, A. T., Graphs, Groups and Surfaces, North-Holland, Amsterdam, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shahrokhi, F., Székely, L.A. (1994). Concurrent flows and packet routing in Cayley graphs (Preliminary version). In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57899-4_63
Download citation
DOI: https://doi.org/10.1007/3-540-57899-4_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57899-4
Online ISBN: 978-3-540-48385-4
eBook Packages: Springer Book Archive