Abstract
We propose a scheme for constructing expander based networks, by starting with a skeleton (directed and weighted) graph, and fleshing out its edges into expanders. Particular cases which can be built this way are: the multibutterfly, the multi-Beneš, a certain fat-tree and a superconcentrator.
The problem of on-line deterministic routing through any expander based network is shown to be solvable by a generalization of Upfal's algorithm.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., T. Leighton, B. Maggs, “On-line algorithms for path selection in a nonblocking network,” Proc. of the Twenty Second Annual ACM Symp. on Theory of Computing, pp. 149–158, 1990.
Leighton, F.T. and B.M. Maggs, “Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks,” IEEE Trans. Comp., vol. 41, pp. 578–587, 1992.
Leiserson, C.E, “Fat-Trees: Universal networks for hardware-efficient supercomputing,” IEEE Trans. Comp., vol. C-34, pp. 892–901, 1985.
Pippenger, N.J., “Superconcentrators,” SIAM J. Comput., vol. 6, pp. 298–304, 1977.
Upfal, E. “An O(log N) deterministic packet routing scheme,” JACM, vol. 39, pp. 55–70, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Even, S., Litman, A. (1994). A unified scheme for routing in expander based networks. In: Bonuccelli, M., Crescenzi, P., Petreschi, R. (eds) Algorithms and Complexity. CIAC 1994. Lecture Notes in Computer Science, vol 778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57811-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-57811-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57811-6
Online ISBN: 978-3-540-48337-3
eBook Packages: Springer Book Archive