
ALT AI-RAN platforms are expected to share CPU and GPU resources between radio workloads and AI services. Aggregate telemetry reports operating conditions, but timing changes may reflect different workloads, processors, or measurement boundaries. We propose workload-aware monitoring that associates radio-work descriptors with processing paths, timing boundaries, and operating context before comparing like with like. In 16 over-the-air downlink experiments, hybrid dispatch (CPU for transport blocks (TBs) below 4,096 bytes and GPU otherwise) has 29.66% and 22.93% lower mean host-callback durations than direct GPU dispatch, without and with a synthetic GPU co-runner, respectively. Grouping locates the separation in small TBs, while large-TB callback-duration ranges overlap. These observations identify a candidate for complementary CPU/GPU use.

ALT Radio access network (RAN) telemetry reveals radio conditions, protocol behavior, and their consequences for applications. Evaluating its usefulness requires controlled impairments and observations of the same execution. We present C and Python channel brokers and a fault injection workflow for software 5G testbeds connecting an OCUDU base station and a software UE through ZeroMQ. The brokers apply scheduled, directional transformations to I/Q samples and restore the link, while the workflow jointly records applied faults, native and programmable (codelet) telemetry, and application delay. We demonstrate this capability through 45 comparative trials of brief uplink interruptions and stepped additive noise. These use cases distinguish recognizing a radio change from measuring its service consequence: native missing-feedback events retrospectively identify interruptions, whereas noise changes decoding-error measurements without producing those events. Median on-time round-trip times rema

ALT Researchers need blockchain experimental environments with configurable workloads, controllable network conditions, and observable outcomes. Public blockchains and testnets limit experimental control, model-based simulators omit real client implementations, and real-client environments face challenges in combining network control with resource-efficient deployment. We present ChainSEED, a scalable, high-fidelity blockchain emulator built on the SEED Internet Emulator. It separates blockchain configuration from client placement on a configurable routed network. For Ethereum PoS, it organizes separately configured execution, consensus, and validator clients and provides APIs for customizing genesis state, peer connections, and client software. A transaction generator informed by Ethereum mainnet activity, application interfaces, and chain- and node-level monitoring support experiments. ChainSEED also supports Monero and Solana. We examine beacon-node memory reduction, execution-client me

ALT Unmanned Aerial Vehicles (UAVs) in Flying Networks (FNs) increasingly require mechanisms to translate high-level natural language objectives into executable missions. Although Large Language Models (LLMs) have demonstrated the feasibility of language-driven UAV control, existing approaches typically rely on static model configurations and overlook mission-aware performance variability. This paper presents AERIAL, a benchmark-driven framework for adaptive LLM selection in hybrid edge-cloud UAV control. AERIAL separates systematic model benchmarking from mission execution, deriving empirical scenario-model mappings and applying them at runtime for mission-aware selection. Evaluation across 720 automated simulation runs spanning navigation, spatial reasoning, and algorithm invocation revealed significant performance variability depending on scenario-model pairing. A case study integrating AERIAL with a FNs placement algorithm further validated the framework's ability to interface with dom

ALT Ambient Internet of Things (A-IoT) devices operate under stringent energy constraints, relying on harvested power in the μW-to-mW range and limited energy storage. The A-IoT air interface for active devices is still under development; we therefore use Narrowband Internet of Things (NB-IoT) as an implementable reference for evaluating autonomous Uplink (UL) access under harvested energy. Under these conditions, the standard NB-IoT contention-based Random Access (RA) procedure incurs substantial per-packet overhead, making UL access in dense A-IoT networks increasingly energy-expensive. Context-retaining UL access schemes reduce this overhead, but their energy-latency trade-offs are insufficiently studied in literature under realistic harvesting and protocol constraints. To address this gap, we extend the LENA-NB ns-3 module with solar energy harvesting, supercapacitor storage, and a hysteretic brown-out mechanism, and propose Hybrid Scheduling Request (HSR), a hybrid UL access scheme co

ALT Distributed quantum computing (DQC) is a promising near-term approach for executing circuits that exceed the capacity of a single quantum processing unit (QPU). Prior work has made significant progress on circuit partitioning and reconstruction, but practical DQC requires more than cutting a circuit into smaller pieces. A runtime system must determine whether to execute the circuit intact, cut it for sequential execution on one QPU, or distribute it across multiple QPUs, while accounting for queueing, communication, reconstruction, and hardware constraints. We present a resource-aware scheduler for DQC that compares these execution alternatives at runtime using explicit models of QPU execution, communication, and host-side reconstruction, together with hardware-informed timing derived from simulated IBM QPUs. By treating communication and reconstruction as first-class scheduling costs, the scheduler selects execution plans using a more realistic view of end-to-end overhead than cutting

ALT Antenna diversity in Internet of Things (IoT) devices is explored to address challenges associated with fixed device orientation and interference from nearby metallic objects, which can degrade wireless network performance. Integrating multiple antennas with different polarizations can significantly enhance signal quality and network reliability. Experiments demonstrated significant improvements in link quality, with gains exceeding 30 dB in received signal strength for specific scenarios. Already the addition of a second PCB-based antenna alone, resulted in a 17 dB improvement. These findings suggest that the added complexity in hardware and software to incorporate antenna diversity could well be justified by the resulting enhancements in network stability for real-world applications.

ALT Alarm root-cause analysis is studied on data that cannot be shared. Operator logs are confidential, so what the field publishes is a causal graph between alarm types rather than per-incident causes, a fixed scenario set, gated, or never released. Two recent benchmarks carry per-incident root causes at scale; neither states a download location or a licence. We give a generator rather than a dataset. It runs on real backbone topologies from the Internet Topology Zoo and records the exact root cause and the propagation path of every alarm – a by-product of generation, not a labelling pass. Every emitted field binds to a term in NORIA-O, RFC 8632, RFC 8345 or TMF642, and an unknown term fails the run. We ship fixed configurations, splits, a scorer and nine baselines. A one-line rule – rank the device that raised the earliest critical alarm – takes top-1 at 0.650 against 0.575 for our own temporal method, and wins 13 of 15 runs over three backbones and five seeds. An LLM given the same view

ALT Carpet bombing attacks distribute malicious traffic across many destinations within a network prefix, while operational monitoring commonly provides destination-specific telemetry for only a subset of those targets. This creates an attack-conditional observability problem that is not captured by address utilization or nominal monitoring coverage. We introduce the Prefix Visibility Ratio (PVR), defined as the fraction of attacked destinations for which the telemetry required by the host-level evidence plane is available, and argue that PVR should be treated as an explicit evaluation dimension for carpet bombing detection. We then present VANTA (Visibility-Aware Network Threat Analysis) as one concrete way to operationalize this principle. VANTA combines host-level and prefix-level anomaly scores, estimates PVR online from router-side destination evidence and the monitored-destination inventory, and adjusts evidence fusion according to both estimated visibility and estimator confidence.

ALT Pingmesh monitors datacenter networks through periodic pings between servers. In reconfigurable datacenter networks, topology engineering (TPE) and traffic engineering (TE) make uniform server-pair probing inefficient: a pinglist wastes budget retesting common paths while missing low-probability interfaces. Frequent control-plane updates further require rapid pinglist refresh, and cause path ambiguity at control-plane boundaries for fault localization. We present D-Pingmesh, a probing and fault-localization system co-designed with the TPE/TE control plane. Its control-plane-aware generator builds task-efficient pinglists by greedily admitting probes with high interface coverage under the current TPE/TE snapshot. An incremental replay-and-repair mechanism updates pinglists across reconfigurations rather than recomputing from scratch. At control-plane boundaries, a Rho-EM localizer jointly infers per-task old/new-path mixture weights and the fault set through EM-style iteration. We evalu

ALT Message Queue Telemetry Transport (MQTT) is widely used in IoT environments due to its lightweight publish-subscribe design and suitability for resource-constrained networks. While current MQTT security studies mainly focus on detecting attacks and optimizing classification performance, this work takes a different perspective by presenting a cross-dataset, tool-aware characterization of MQTT traffic at the flow level. This perspective is motivated by the fact that flow-generation is tool-dependent: flows are not directly observed in packet captures, but are constructed through tool-specific decisions about packet grouping, flow termination, and feature export. Using packet captures from 4 public MQTT datasets, we generated over 380K flows with 3 open-access flow-generation tools: Zeek-flowmeter, Argus, and NTLFlowLyzer. We analyzed the tool-specific flows using K-means, DBSCAN, and HDBSCAN, with and without PCA-based dimensionality reduction. We measured clustering quality using 2 metr

ALT Looking Glass servers (LGs) allow users and network operators to debug issues or measure performance to/from arbitrary, external IP addresses, making LGs a valuable tool in a variety of analyses. To assess the reliability of LGs as an independent and free set of vantage points, we perform an analysis of 4487 LG servers across 144 countries. We analyze LGs by comparing them to six different geolocation databases from four providers, and by conducting active measurements on LGs. In our RTT measurements we find 9 of 18 LG providers have at least one server with an RTT-disconfirmed location. We also find substantial differences between geolocation databases' ability to locate LGs, with IPinfo showing the closest distance to LGs.

ALT High-performance packet processing frameworks, such as the Data Plane Development Kit (DPDK), are widely used in modern network systems, yet they are rarely integrated into networking curricula. As a result, students often lack exposure to the performance considerations and low-level design choices that shape real-world packet processing systems. We describe a semester-long course project in which students implement a do-it-yourself (DIY) software router using DPDK in a master-level computer networking course. The project guides students through the design and implementation of a multithreaded router, the development of a routing table data structure, and the evaluation of forwarding performance using standard benchmarking tools. We present the project structure and the virtualized infrastructure used to support classes of realistic size. Based on several iterations of the course and survey feedback from participating students, we discuss the observed workload, learning outcomes, and c

ALT Radio maps characterize the spatial distribution of wireless conditions and are fundamental to network planning and optimization. However, existing learning-based methods reconstruct isolated radio-map snapshots and do not model how network actions drive the evolution of the radio environment. In this paper, we present RadioDreamer, a two-stage world model that unifies action-conditioned radio-map forecasting and imagination-based network optimization within a latent space. To learn causal environmental transitions from sequential interactions, we introduce a structured spatio-temporal transformer backbone coupled with dynamic-region supervision, enabling accurate modeling of action-sensitive areas. Second, rather than relying on conventional physical trial-and-error, RadioDreamer establishes a general planning paradigm that generates counterfactual latent trajectories to evaluate and optimize long-horizon network parameter configurations. Experiments show that RadioDreamer improves bo

ALT AI agents are increasingly deployed in mobile edge environments to autonomously handle diverse tasks through multi-step workflows. Unlike conventional dependency-aware tasks with predefined dependency structures, agent workflows are dynamically generated based on intermediate execution results. To minimize the weighted sum of job completion latencies, this paper models partially revealed agent workflows using dynamic workflow graphs and formulates an online scheduling problem that jointly optimizes computation placement, wireless resource block allocation, and edge computing resource allocation. To address the uncertainty of future workflow evolution, we first transform the weighted completion time objective into an equivalent per-slot holding cost and characterize the optimal policy through a Bellman equation. We then construct a tractable look-ahead cost-to-go surrogate based on the revealed workflow and the estimated remaining latencies of active jobs. The proposed scheduling algori

ALT Collecting relevant data from Internet of Things devices under freshness and energy constraints is a key challenge in 6G edge networks. A lightweight neural network on the device filters irrelevant observations, but storing it in dynamic random access memory consumes refresh energy during standby. This letter proposes a pull-based framework where an edge server remotely activates and approximates memory and jointly selects the activation timing, refresh period, model size, and transmission threshold. We derive the expected freshness and energy over erasure channels in closed form and show that the scheme consumes less energy than an always-on baseline under the same freshness constraint.

ALT In this paper, we present 5uGUE, a large language model (LLM)-driven hardware-in-the-loop agent, which enables the wireless fuzzing of 5G-enabled devices (such as mobile phones). 5uGUE combines multi-step reasoning with tool-assisted interaction and integrates into the fuzzing pipeline by leveraging specialized tools for internet search, 5G protocol analysis, memory management, and test-case execution. The agent iteratively generates test cases, executes them on targets, collects runtime feedback, and adaptively refines the fuzzing strategy. We evaluate 5uGUE on five commercial off-the-shelf (COTS) 5G devices across six LLMs. The best performing runs for 5uGUE trigger 167 crashes in total (141 novel and 31 unique) within 60 interaction turns (49 to 133 minutes total runtime). In contrast, the best runs for the state-of-the-art baseline (5GHOUL) discovers only 13 crashes in total (10 novel and 6 unique) within 150 minutes. Overall, by integrating LLM-driven agents, 5uGUE demonstrates si

ALT Jednym z najważniejszych wyzwań związanych z implementacją sieci Open RAN o architekturze zorientowanej na użytkownika jest odpowiednie formowanie tzw. klastrów obsługujących. Problem ten może być efektywnie rozwiązany za pomocą zaproponowanego Agenta AI bazującego na modelu językowym. Wyniki symulacji pokazały, że zaproponowane rozwiązanie pozwala na ponad 2-krotne zwiększenie mediany rozkładu przepływności użytkowników względem standardowej architektury zorientowanej na sieć.

ALT Autonomous agents are moving from application-layer components to active participants in networked systems. They not only generate traffic but also perceive context, express intent, invoke services, coordinate with other agents, and act under task, policy, and resource constraints. This evolution exposes a mismatch between emerging agentic interactions and conventional endpoint- and traffic-centric network abstractions. This white paper introduces Agentic Communication Networks (ACN) as a network-centric paradigm for the time when agents become first-order network entities. At its core, ACN reshapes networking around three fundamental aspects. First, agents are represented as identifiable and governable network entities with explicit identity, authority, and lifecycle. Second, agentic services are expressed through intent, capability, context, policy, and task state, allowing the network to capture what an agent seeks to accomplish and under what conditions. Third, agentic execution be

