A unified scheme for routing in expander based networks

  • Shimon Even
  • Ami Litman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 778)


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.


Load Factor Bipartite Graph Vertical Edge Complete Bipartite Graph Unify Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    Leiserson, C.E, “Fat-Trees: Universal networks for hardware-efficient supercomputing,” IEEE Trans. Comp., vol. C-34, pp. 892–901, 1985.Google Scholar
  4. 4.
    Pippenger, N.J., “Superconcentrators,” SIAM J. Comput., vol. 6, pp. 298–304, 1977.Google Scholar
  5. 5.
    Upfal, E. “An O(log N) deterministic packet routing scheme,” JACM, vol. 39, pp. 55–70, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Shimon Even
    • 1
  • Ami Litman
    • 1
  1. 1.Computer Science DepartmentTechnion, Israel Institute of TechnologyIsrael

Personalised recommendations