Pith. sign in

REVIEW 1 cited by

A Survey and Evaluation of Data Center Network Topologies

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1605.01701 v1 pith:HCX4Z2TW submitted 2016-05-05 cs.DC cs.NI

A Survey and Evaluation of Data Center Network Topologies

classification cs.DC cs.NI
keywords datanetworkcenterstopologieswellcentercomputeefficient
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Data centers are becoming increasingly popular for their flexibility and processing capabilities in the modern computing environment. They are managed by a single entity (administrator) and allow dynamic resource provisioning, performance optimization as well as efficient utilization of available resources. Each data center consists of massive compute, network and storage resources connected with physical wires. The large scale nature of data centers requires careful planning of compute, storage, network nodes, interconnection as well as inter-communication for their effective and efficient operations. In this paper, we present a comprehensive survey and taxonomy of network topologies either used in commercial data centers, or proposed by researchers working in this space. We also compare and evaluate some of those topologies using mininet as well as gem5 simulator for different traffic patterns, based on various metrics including throughput, latency and bisection bandwidth.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Optimal Reconfiguration of Distributed Battery Networks Under Connectivity and Energy Constraints

    eess.SY 2026-07 unverdicted novelty 3.0

    Presents a MILP-extended GeoSteiner algorithm for dynamic battery network reconfiguration that improves lowest battery levels from 2.7% to 68.6% and cuts reconfiguration cost by 72.2% in 20-terminal simulations.