arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1402.2531cs.NI
收藏

测量和理解网络拓扑的吞吐量

Measuring and Understanding Throughput of Network Topologies

Sangeetha Abdu Jyothi, Ankit Singla, P. Brighten Godfrey, Alexandra Kolla

摘要:

高吞吐量在数据中心和HPC网络中特别受关注。尽管已经提出了无数的网络拓扑,但缺乏跨拓扑和跨流量模式的广泛的头对头比较,并且比较最差情况吞吐量性能的正确方法是一个微妙的问题。在本文中,我们开发了一个框架,基准的网络拓扑结构的吞吐量,使用双管齐下的方法。首先,我们研究了各种合成和实验测量的流量矩阵(TM)的性能。其次,我们展示了如何测量最坏情况下的吞吐量生成一个接近最坏情况的TM为任何给定的拓扑结构。我们应用该框架来研究这些TM在广泛的网络拓扑结构中的性能,揭示了拓扑结构的性能与扩展,跨TM的性能的鲁棒性,以及分散的工作负载放置的影响。我们的评估代码是免费提供的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑