Efficient Routing in Data Center with Underlying Cayley Graph
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 189-197
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A CLASS OF DATA-CENTER NETWORK MODELS OFFERING SYMMETRY, SCALABILITY, AND RELIABILITYParallel Processing Letters, 2012
- Analytic performance comparison of hypercubes and star graphs with implementation constraintsJournal of Computer and System Sciences, 2008
- Cayley graphs as models of deterministic small-world networksInformation Processing Letters, 2006
- Cayley graphs and interconnection networks1997
- The efficiency of greedy routing in hypercubes and butterfliesIEEE Transactions on Communications, 1994
- Efficient routing schemes for multiple broadcasts in hypercubesIEEE Transactions on Parallel and Distributed Systems, 1993
- Processor interconnection networks from Cayley graphsDiscrete Applied Mathematics, 1992
- A group-theoretic model for symmetric interconnection networksIEEE Transactions on Computers, 1989
- The minimum-length generator sequence problem is NP-hardJournal of Algorithms, 1981
- Construction of defining relators for finite groupsDiscrete Mathematics, 1973