Jul 2026· Fall Joint Computer Conference· pp. 249-256· 0 citations· 18 references
Abstract
Distributed simulation in cloud-edge environments typically relies on global synchronization to maintain causal event ordering, which introduces significant coordination overhead across wide-area networks. We present SF-LC (Synchronization-Free Local Consensus), a decentralized time management mechanism that replaces $N$-party barrier synchronization with bilateral dependency acknowledgment between the two nodes involved in each causal dependency. Each edge node schedules events autonomously and coordinates only with the relevant peer per cross-edge dependency. We formally prove that the maximum fidelity loss is bounded under the assumption of bounded network delay. Experiments across 27 configurations with 243 runs demonstrate that SF-LC reduces average end-to-end latency by over 73% compared to periodic global synchronization while achieving perfect simulation fidelity and substantially higher resource utilization. SF-LC also shows a directional latency advantage over simplified optimistic synchronization (without GVT or anti-messages).
Emergency, remote, and infrastructure-constrained environments cannot always rely on cellular networks or continuous Internet connectivity. LoRa offers an alternative for direct, long-range communication between low-power devices without depending on nearby cellular infrastructure, but its low data rate and variable tr...
Francis Kagai, Philip Branch, J. But et al.· Telecom· 0 citations
Ensuring reliable and timely consensus among Internet of Vehicles (IoV) nodes is critical for safety and operational efficiency, particularly under high mobility and dynamic network conditions. Traditional consensus protocols, however, do not explicitly incorporate service-level objectives (SLOs) such as commit latency...
Awais Bilal, Kashif Sharif, Lie-Huang Zhu et al.· IEEE Transactions on Network...· 0 citations
In dynamic edge networks, multi-node collaborative inference often suffers from amplified tail latency due to background traffic competition and node load variations. While existing work focuses on static computation-side optimization, it lacks online control over dynamic network factors. To bridge this gap, we propose...
Cooperative target tracking in decentralized networks depends on a shared notion of time. We advocate monotonic logical time—a network-computed time function that all agents agree on and that never regresses—as a coordination primitive for distributed estimation in lossy, asymmetric wireless networks at the edge, where...
I. Arkhipov, Evgenii Krokhalev, Elizaveta Tarasova et al.· IEEE Access· 0 citations
City-scale microscopic traffic simulation is increasingly used for policy evaluation, operational planning, and disruption analysis, where repeated scenario runs must retain vehicle-level trajectories rather than only aggregate traffic indicators. This requirement creates an efficiency–consistency trade-off: single-nod...
This paper researches recursive consensus filtering in networked systems affected by random transmission delays under edge-based event-triggered schemes. The study introduces a dynamic edge-level triggering rule to streamline data exchange and alleviate the network’s communication burden. The information incompleteness...
Y. Xing· Advanced Electromagnetics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
