2014/02/11 by Jyothi, Sangeetha Abdu, Ankit Singla, Singla, Ankit +3 · 1 citation
Computer Science · #Caching and Content Delivery #Cloud Computing and Resource Management #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Peer-to-Peer Network Technologies
paper · pdf · doi:10.48550/arxiv.1402.2531
openalex publication_date 2014/02/11 · openalex created_date 2017/08/31 · openalex updated_date 2026/07/28
High throughput is of particular interest in data center and HPC networks. Although myriad network topologies have been proposed, a broad head-to-head comparison across topologies and across traffic patterns is absent, and the right way to compare worst-case throughput performance is a subtle problem. In this paper, we develop a framework to benchmark the throughput of network topologies, using a two-pronged approach. First, we study performance on a variety of synthetic and experimentally-measured traffic matrices (TMs). Second, we show how to measure worst-case throughput by generating a near-worst-case TM for any given topology. We apply the framework to study the performance of these TMs in a wide range of network topologies, revealing insights into the performance of topologies with scaling, robustness of performance across TMs, and the effect of scattered workload placement. Our evaluation code is freely available.