The techniques described in this paper can also be applied to other networks whose underlying structures are trees, and whose blocks are connected by expanding graphs. One example is a class of networks called multi-fat-trees, which are based on the fat-tree networks of Leiserson and Greenberg [1, 8].