数据中心网络中的可重构路由
Reconfigurable routing in data center networks
AI总结:
针对现有可重构路由问题研究未考虑数据中心静态网络高度结构化特性的不足,本文首次证明了超立方体等结构化静态网络下该问题的多项难解性结论,并拓展了部分可解性结论。
摘要:
混合网络是一种由光交换机增强的静态(电子)网络。混合网络中的可重构路由问题(Reconfigurable Routing Problem,RRP)是指为增强静态网络的光交换机寻找配置方案,以实现给定工作负载的最优传输的问题。此前已有研究在多种场景下探讨过该问题,既得到了可解性结论,也证明了其NP难特性。然而,与该问题关联最紧密的数据中心网络和互连网络,其静态网络几乎都具备高度结构化的特点(通常是节点对称的),但以往所有研究结论均假设静态网络可以是任意结构——这使得现有的计算难度结论技术相关性较弱,且更容易被证明。本文首次针对底层静态网络高度结构化(例如由超立方体构成)的RRP,证明了多项难解性结论,同时也拓展了部分现有的可解性结论。
英文摘要:
A hybrid network is a static (electronic) network that is augmented with optical switches. The Reconfigurable Routing Problem (RRP) in hybrid networks is the problem of finding settings for the optical switches augmenting a static network so as to achieve optimal delivery of some given workload. The problem has previously been studied in various scenarios with both tractability and NP-hardness results obtained. However, the data center and interconnection networks to which the problem is most relevant are almost always such that the static network is highly structured (and often node-symmetric) whereas all previous results assume that the static network can be arbitrary (which makes existing computational hardness results less technologically relevant and also easier to obtain). In this paper, and for the first time, we prove various intractability results for RRP where the underlying static network is highly structured, for example consisting of a hypercube, and also extend some existing tractability results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。