Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity

Dariusz R. Kowalski; Miguel A. Mosteiro

Home/Archive/arXiv

arXiv · 2202.07167

Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity

Dariusz R. Kowalski·Miguel A. Mosteiro

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this work we address the question of efficiency of distributed computing in anonymous, congested and highly dynamic and not-always-connected networks/systems. More precisely, the system consists of an unknown number of anonymous nodes with congestion on links and local computation. Links can change arbitrarily from round to round, with only limitation that the union of any T consecutive networks must form a temporarily connected (multi-)graph on all nodes (knowledge of T is the only information the nodes require, otherwise the communication would not be feasible). Nodes do not have any IDs, only some number l of them have a bit distinguishing them from nodes without such a bit. In each round a node can send and receive messages from its current neighbors. Links and nodes are congested, in the sense that the length of messages and local cache memory for local computation is (asymptotically) logarithmic. All-to-all communication is a fundamental principle in distributed computing - it assumes that each node has an input message to be delivered to all other nodes. Without loss of generality, the size of each input message is logarithmic to fit in the link and node congestion assumption; otherwise, they could be split in logarithmic batches and considered one-by-one. Because of anonymity, each node needs to receive only a set of all input messages, each accompanied by a number of initiating nodes (message multiplicity). We prove that this task can be done in time polynomial in the (initially unknown) number of nodes n and in the lower bound on the isoperimetric numbers of dynamically evolving graphs. This allows to efficiently emulate a popular Congested Clique model on top of Anonymous Dynamic Congested Systems (ADCS) with Opportunistic Connectivity, even if the number of nodes may arbitrarily change in the beginning of emulation.

Explore related subjects

cs.DC

Keep this discovery

BibTeX RIS

Dariusz R. Kowalski, Miguel A. Mosteiro. 2022-02-15. Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity. https://arxiv.org/abs/2202.07167

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Online Treasure Hunt in Vertex-Permuted Dynamic Rings

We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions on the sequence of permutations used in the dynamic ring. We then study the $VP(\delta)$ setting, in which for every pair $i, j$ of vertices, the edge $(i, j)$ is guaranteed to appear within $\delta$ steps. We show that the class $VP(\delta)$ is feasible only for $\delta \geq \left\lceil \frac{n-1}{2}\right\rceil$. For the one-agent case, we show a tight bound of $\Theta(\delta n)$ on the worst-case search time as well as competitive ratio of any online algorithm for treasure hunt, provided $\delta \geq 2n$. We then give an optimal algorithm for $k$ agents, thereby showing that $k$ agents can obtain a speedup of $k$ on the worst-case search time. Finally, in the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, we show that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.

cs.DC↗

arXiv2026

The Computing Channel: How Modulation Programs the Airwaves

Distributed computing and distributed artificial intelligence require frequent exchanges of intermediate results, although many applications need only an aggregate rather than messages from individual devices. Conventional systems recover each message before computing the aggregate, whereas over-the-air computation (OAC) exploits simultaneous transmission to obtain it directly. However, dominant OAC implementations rely on analog signaling, creating a mismatch with finite-precision data and digital communication procedures. This article presents digital function-oriented communication, in which finite-alphabet symbol representations and receiver decisions are jointly designed so that multiple-access superposition encodes the desired function without recovering individual inputs. We introduce its computational-constellation principle, main design approaches, extensions, and implementation challenges. Federated edge learning illustrates how the framework can reduce user-dependent data-bearing resources while operating directly on quantized model updates.

cs.DC↗

arXiv2026

Can AI Remediate Backend Failures Safely? GuardedAct with Blast-Radius-Aware Sandboxing

Large Language Models (LLMs) have shown promising capabilities in generating remediation actions for microservice failures. However, directly executing AI-generated repair actions in production risks cascading collateral damage. We propose GuardedAct, a sandbox-first remediation framework that interposes a blast-radius-aware verification layer between the LLM action generator and the production environment. GuardedAct operates in four phases: (1) ingesting a diagnosis report together with the live system topology and recent telemetry, (2) prompting an LLM to produce a ranked list of candidate remediation actions, (3) simulating each action in a lightweight digital-twin sandbox that estimates the blast radius and assigns a risk label, and (4) enforcing a rollback-confidence gate that auto-executes only low-risk actions while escalating high-risk ones for human review. We evaluate GuardedAct on five fault scenarios injected into the DeathStarBench social-network application. Experimental results show that GuardedAct achieves an overall recovery rate of 87.4% while reducing collateral damage by 79.7% relative to direct LLM execution (from 25.6% to 5.2%), at the cost of a modest sandbox-induced increase in mean time to recovery (approximately 8 s). Ablation studies confirm that each component contributes meaningfully to the safety-speed trade-off.

cs.DC↗