pith. sign in

arxiv: 1904.03263 · v1 · pith:O3JIR27Pnew · submitted 2019-04-05 · 💻 cs.NI

ReNets: Toward Statically Optimal Self-Adjusting Networks

classification 💻 cs.NI
keywords self-adjustingrenetsdemand-awarenetworknetworksoptimalstaticallytopology
0
0 comments X
read the original abstract

This paper studies the design of self-adjusting networks whose topology dynamically adapts to the workload, in an online and demand-aware manner. This problem is motivated by emerging optical technologies which allow to reconfigure the datacenter topology at runtime. Our main contribution is ReNet, a self-adjusting network which maintains a balance between the benefits and costs of reconfigurations. In particular, we show that ReNets are statically optimal for arbitrary sparse communication demands, i.e., perform at least as good as any fixed demand-aware network designed with a perfect knowledge of the future demand. Furthermore, ReNets provide compact and local routing, by leveraging ideas from self-adjusting datastructures.

This paper has not been read by Pith yet.

discussion (0)

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