We present a randomized self-adjusting tree network, which leverages randomization to reduce the expected network reconfiguration cost by a constant factor, ...

Jan 21, 2023 · In this paper we investigate the benefits of randomization in the design of self-adjusting network topologies: networks that dynamically adapt ...

Dec 15, 2022 · In this paper we investigate the benefits of randomization in the design of self-adjusting network topologies: networks that dynamically ...

We present analytical results for the distribution of first-passage (FP) times of random walks (RWs) on random regular graphs that consist of N nodes of ...

We consider the problem of designing dynamic network topologies that self-adjust to the (possibly changing) traffic pattern they serve.

Abstract—The performance of many data-centric cloud applications critically depends on the performance of the underlying datacenter network.

This paper studies analytically and empirically, online algorithms for this problem. In particular, we explore how to derandomize RANDOM-PUSH.

This article presents $DiSplayNet$ , the first fully distributed self-adjusting network. $DiSplayNet$ relies on algorithms that perform decentralized and ...

Abstract—We consider the problem of designing dynamic network topologies that self-adjust to the (possibly changing) traffic pattern they serve.

Self-adjusting algorithms enable distributed systems to adjust their properties dynamically as the input pattern changes.