Comprehensive Performance and Robustness Analysis of Expander-Based Data Centers
Bibliographic record
Abstract
Data center networks have been gaining a lot of attention in recent years. These networks are scaling up quickly with the explosive nature of current applications. Lately, a lot of efforts have been exerted to improve the performance of these networks compared to the often performance-lagging standard Clos-based topologies. One of the approaches for performance improvement is to use alternative data center network topologies. Consequently, researchers explored topologies based on Expander Graphs (EGs), such as Jellyfish, Xpander, and STRAT, where they exploited the sparse and incremental nature of these new topologies. This paper investigates the STructured Re-Arranged Topology (STRAT) as a potentially robust and efficient design for next-generation data centers. Robustness and throughput metrics are adopted to benchmark the performance of STRAT against the well-known Expander architectures, which show better performance than that of present topologies, (e.g., Fat-Tree, BCube). This paper shows that STRAT has better structural properties than Jellyfish and Xpander, making it more robust to switch and link failures. Specifically, STRAT possesses lower average shortest path length and diameter, higher spectral gap, and higher algebraic connectivity. These exceptional properties allow STRAT to achieve better throughput. Such observations are validated through extensive flow and packet level simulations, demonstrating STRAT’s superior performance in terms of the flow completion time as compared to other Expanders.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.003 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".