AbstractWe study here systems of distributed entities that can actively modify their communication network. This gives rise to distributed algorithms that apart from communication can also exploit network reconfiguration to carry out a given task. Also, the distributed task itself may now require a global reconfiguration from a given initial network $$G_s$$
G
s
to a target network $$G_f$$
G
f
from a desirable family of networks. To formally capture costs associated with creating and maintaining connections, we define three edge-complexity measures: the total edge activations, the maximum activated edges per round, and the maximum activated degree of a node. We give (poly)log(n) time algorithms for the task of transforming any $$G_s$$
G
s
into a $$G_f$$
G
f
of diameter (poly)log(n), while minimizing the edge-complexity. Our main lower bound shows that $$\varOmega (n)$$
Ω
(
n
)
total edge activations and $$\varOmega (n/\log n)$$
Ω
(
n
/
log
n
)
activations per round must be paid by any algorithm (even centralized) that achieves an optimum of $$\varTheta (\log n)$$
Θ
(
log
n
)
rounds. We give three distributed algorithms for our general task. The first runs in $$O(\log n)$$
O
(
log
n
)
time, with at most 2n active edges per round, a total of $$O(n\log n)$$
O
(
n
log
n
)
edge activations, a maximum degree $$n-1$$
n
-
1
, and a target network of diameter 2. The second achieves bounded degree by paying an additional logarithmic factor in time and in total edge activations. It gives a target network of diameter $$O(\log n)$$
O
(
log
n
)
and uses O(n) active edges per round. Our third algorithm shows that if we slightly increase the maximum degree to polylog(n) then we can achieve $$o(\log ^2 n)$$
o
(
log
2
n
)
running time.
Strong eventual consistency of the collaborative editing framework WOOT
