Distributed computation and reconfiguration in actively dynamic networks
-
Published:2021-12-19
Issue:
Volume:
Page:
-
ISSN:0178-2770
-
Container-title:Distributed Computing
-
language:en
-
Short-container-title:Distrib. Comput.
Author:
Michail OthonORCID, Skretas GeorgeORCID, Spirakis Paul G.ORCID
Abstract
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.
Funder
Engineering and Physical Sciences Research Council
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference30 articles.
1. Akitaya, H.A., Arkin, E.M., Damian, M., Demaine, E.D., Dujmović, V., Flatland, R., Korman, M., Palop, B., Parada, I., van Renssen, A., Sacristán, V.: Universal reconfiguration of facet-connected modular robots by pivots: the $${O(1)}$$ musketeers. Algorithmica 83(5), 1316–1351 (2021) 2. Almethen, A., Michail, O., Potapov, I.: Pushing lines helps: Efficient universal centralised transformations for programmable matter. Theor. Comput. Sci. 830–831, 43–59 (2020) 3. Angluin, D., Aspnes, J., Chen, J., Wu, Y., Yin, Y.: Fast construction of overlay networks. In: 17th ACM symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 145–154 (2005) 4. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235–253 (2006) 5. Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279–304 (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Design of an Electronic Online Learning Platform Based on WebGIS Algorithm;2023 International Conference on Network, Multimedia and Information Technology (NMITCON);2023-09-01
|
|