Distributed computation and reconfiguration in actively dynamic networks

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