D. Aguirre-guerrero, M. Camelo, L. , and P. Viì, WMGR: A generic and compact routing scheme for data center networks, IEEE/ACM Transactions on Networking, vol.26, issue.1, pp.356-369, 2018.

S. B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Transactions on Computers, vol.38, issue.4, pp.555-566, 1989.

A. H. Dekker and B. D. Colbert, Network robustness and graph topology, 27th Australasian Conference on Computer Science, vol.26, pp.359-368, 2004.

D. B. Eppstein, Finding the k shortest paths, SIAM Journal on Computing, vol.28, issue.2, pp.652-673, 1998.

D. B. Epstein, M. S. Paterson, J. W. Cannon, D. F. Holt, S. V. Levy et al., Word Processing in Groups. A. K. Peters, Ltd, 1992.

C. Guo, G. Lu, D. Li, H. Wu, X. Zhang et al., BCube: A high performance, server-centric network architecture for modular data centers, ACM SIGCOMM Conference on Data Communication, pp.63-74, 2009.

M. C. Heydemann, Cayley graphs and interconnection networks, 1997.

D. Holt and . Kbmag-package, A Knuth-Bendix on Monoids, and Automatic Groups, pp.2018-2020, 2017.

D. F. Holt, B. Eick, and E. A. O'brien, Handbook of computational group theory. Discrete mathematics and its applications, 2005.

J. Kim, J. Balfour, and W. J. Dally, Flattened butterfly topology for on-chip networks, IEEE Computer Architecture Letters, vol.6, issue.2, pp.37-40, 2007.

D. Knuth and P. Bendix, Simple word problems in universal algebras, Automation of Reasoning, Symbolic Computation, pp.342-376, 1983.

C. Lai, On the construction of all shortest vertex-disjoint paths in cayley graphs of abelian groups, Theoretical Computer Science, vol.571, pp.10-20, 2015.

D. Robinson, Number 80 in Graduate Texts in Mathematics, 1982.

J. Ryu, E. Noel, and K. W. Tang, Fault-tolerant routing on borel cayley graph, IEEE International Conference on Communications (ICC), pp.2872-2877, 2012.

A. Singh, Load-balanced Routing in Interconnection Networks, 2005.

M. Tokuda, Y. Hirai, and K. Kaneko, An algorithm for k-pairwise cluster-fault-tolerant disjoint paths in a burnt pancake graph, 2015 International Conference on Computational Science and Computational Intelligence (CSCI), pp.651-655, 2015.

L. G. Valiant, A scheme for fast parallel communication, SIAM Journal on Computing, vol.11, issue.2, pp.350-361, 1982.

J. Y. Yen, Finding the k shortest loopless paths in a network, Management Science, vol.17, issue.11, pp.712-716, 1971.

J. Yu, E. Noel, and K. W. Tang, A graph theoretic approach to ultrafast information distribution: Borel cayley graph resizing algorithm, Computer Communications, vol.33, issue.17, pp.2093-2104, 2010.

J. X. Zhou, Z. L. Wu, S. C. Yang, and K. W. Yuan, Symmetric property and reliability of balanced hypercube, IEEE Transactions on Computers, vol.64, issue.3, pp.876-881, 2015.