Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.01094

ncsim: A Lightweight Simulator for Networked Edge Computing with Wireless Interference Modeling

Bhaskar Krishnamachari·Maya Gutierrez·Jared Coleman
View original source ↗Read source document ↗Export metadata ↓

Abstract

Evaluating directed acyclic graph (DAG) task schedulers for wireless edge computing requires jointly modeling compute placement and wireless interference, yet many evaluation setups simplify the wireless coupling. This can lead to rank inversions: a scheduler selected under an interference-free model need not remain best when concurrent wireless traffic is included. We present ncsim, a lightweight discrete-event simulator that combines DAG workflow scheduling with an analytical IEEE 802.11 contention and hidden-interference model in a single Python package. A 108-run factorial experiment on grid networks and DAG workflows finds rank inversions in 6 of 18 scenarios (33.3%). Solo retains single-link MAC overhead, while Full adds concurrent-link wireless effects. Selecting a policy under Solo and executing it under Full incurs a maximum scheduling regret (makespan penalty relative to the best evaluated policy under Full) of 52.3%. Validation includes Bianchi's published numerical and graphical results and fixed-rate ns-3 experiments. The default model closely tracks homogeneous contention. The scheduler results show how wireless coupling can change policy selection within the stated flow model.

Explore related subjects

cs.DCcs.NI

Keep this discovery

BibTeXRIS

Bhaskar Krishnamachari, Maya Gutierrez, Jared Coleman. 2026-09-06. ncsim: A Lightweight Simulator for Networked Edge Computing with Wireless Interference Modeling. https://arxiv.org/abs/2605.01094

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

Discover connections

cs.DC subjectcs.NI subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Update for Decisions, Not Freshness: Goal-Oriented Status Updating and Selective Offloading at the Network Edge

In an edge--cloud collaborative edge-computing environment, an edge node (EN) must decide whether each user task should be executed locally, forwarded to a remote service (or cloud) node (SN), or rejected. The EN observes its local state directly but receives the SN state only through an intermittently refreshed cache. Status updating and task control therefore form an asynchronous closed loop under partial observability. Freshness-driven schemes, including those based on Age of Information (AoI), do not directly value an update by its effect on subsequent task decisions. We propose CoSMO (Co-design of Semantic-state Management and Offloading), a cooperative event-driven reinforcement learning (RL) framework that coordinates semantic status management and selective offloading through realized task utility. CoSMO learns a compact representation of the heterogeneous SN service state. At the SN, a recurrent semi-Markov double deep Q-network (Double DQN) agent jointly selects send/no-send and the next decision interval. At the EN, a task-terminal off-policy value-learning agent makes hierarchical gate--route decisions from local observations and stale remote semantics. The agents maintain separate observations and value targets but share the same realized task-utility stream, without centralized execution. Across the evaluated workload families, CoSMO's reported relative improvement in on-time completion rate over the best-performing competing method averages 18.6%--21.2%. For capacity-aware decision accuracy across the three strict-overload points, the corresponding reported gains average 17.6%--$17.9%.

cs.DC↗
arXiv2026

Learning-Based Collaborative MEC for LLM Inference with Soft-Deadline Awareness via Transformer-Enhanced PPO

This paper investigates collaborative mobile edge computing (MEC) servers for large language model (LLM) inference under soft deadline constraints. In this system, to improve the quality of service, computations are expected to be completed within their deadlines. However, due to dependencies among tasks or subtasks, any missed deadline can lead to catastrophic consequences for the entire request. In this context, this work proposes an extended deadline mechanism with constrained flexibility. The main challenges lie in handling large-scale computations under strict latency constraints while limiting the number of allowable deadline extensions, especially in the presence of task dependencies within each request. To tackle these challenges, we develop a transformer-enhanced proximal policy optimization (PPO) framework that enables efficient collaboration among MEC servers. The proposed approach aims to maximize the number of tasks completed within their deadlines while minimizing the use of deadline extensions. By capturing temporal dependencies and cross-server interactions, the transformer improves decision-making for task migration. Simulation results demonstrate that the proposed method significantly outperforms conventional PPO and heuristic-based approaches in terms of task completion rate and overall system efficiency.

cs.DC↗
arXiv2026

Trust-Aware Routing for Distributed Generative AI Inference at the Edge

Emerging deployments of Generative AI increasingly execute inference across decentralized and heterogeneous edge devices rather than on a single trusted server. In such environments, a single device failure or misbehavior can disrupt the entire inference process, making traditional best-effort peer-to-peer routing insufficient. Coordinating distributed generative inference therefore requires mechanisms that explicitly account for reliability, performance variability, and trust among participating peers. In this paper, we present G-TRAC, a trust-aware coordination framework that integrates algorithmic path selection with system-level protocol design to ensure robust distributed inference. First, we formulate the routing problem as a \textit{Risk-Bounded Shortest Path} computation and introduce a polynomial-time solution that combines trust-floor pruning with Dijkstra's search, achieving sub-millisecond median routing latency at practical edge scales, and remaining below 10 ms at larger scales. Second, to operationally support the routing logic in dynamic environments, the framework employs a \textit{Hybrid Trust Architecture} that maintains global reputation state at stable anchors while disseminating lightweight updates to edge peers via background synchronization. Experimental evaluation on a heterogeneous testbed of commodity devices demonstrates that G-TRAC significantly improves inference completion rates, effectively isolates unreliable peers, and sustains robust execution even under node failures and network partitions.

cs.DC↗