跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文，不再错过。

覆盖计算机全学科，以 AI 为快捷入口。关注方向、作者和关键词，把发现变成持续的研究积累。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+2新增论文
+2其中 AI 相关
+0已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描：2026-11-13 02:57 · 全站最近入库：2026-11-12 06:37各信源进度 →

统计口径与数据新鲜度

统计 2026-11-12 03:24 — 2026-11-13 03:24（北京时间） · 点击数字查看对应简报；AI 相关包含在新增论文内。

最近完成检查：2026-11-13 02:57最近发现新增版本：2026-11-12 06:37库内论文最新更新时间：2026-11-11 08:00

每分钟刷新已保存的数据。空检查不代表采集异常；新收录可能包含历史论文。AI 导读按新增版本计数。

21,675 已收录论文18,323 AI 相关6,056 有修订112 HF 社区发现

浏览论文库

研究日报 / 周报 →按信源浏览 →

时间范围跟随排序：版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常，查看状态 →

找到 223 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-13 02:56（北京时间）
新论文 · v1arXiv:2611.06306

Spatial Path Superposition: A No-Cloning Perspective on MIMO-Inspired Spatial Diversity

Angela Sara Cacciapuoti, Claudio Pellitteri, Marcello Caleffi

原文摘要

Spatial diversity is a key mechanism in classical Multi-Input Multi-Output (MIMO) communications, where multiple propagation alternatives provide redundant observations that improve reliability in noisy environments. A direct translation of this principle to quantum communications is forbidden by the no-cloning theorem, since an unknown quantum state cannot be copied and transmitted through independent links. In this Perspective article, we argue that spatial path superposition provides a no-cloning-compatible analogue of the spatial-diversity principle of MIMO. Rather than duplicating the transmitted quantum state, a quantum carrier is coherently delocalized over multiple communication links, so that alternative spatial evolutions are experienced in quantum superposition. In this framework, classical redundancy is replaced by spatial coherence, and the communication link itself becomes part of the quantum dynamics. Indeed, spatial coherence can enhance the fidelity of the received quantum state, providing the quantum counterpart of the classical diversity gain, and can be converted into bipartite and multipartite entanglement during propagation. This implies that, under suitable coherent path control, noisy channel evolutions can contribute constructively to entanglement generation. This Perspective identifies spatial path superposition as a quantum-native primitive for the Quantum Internet, linking no-cloning-compatible spatial diversity, fidelity enhancement, entanglement generation, and coherent path control.

quant-ph · cs.NI

查看论文
arXiv ↗PDF ↗
版本更新 · v3arXiv:2607.08407

Who Needs DRAM? We Have Fiber

Hannah Atmer, Yuan Yao, Thiemo Voigt, Stefanos Kaxiras

原文摘要

The rising pressure on DRAM availability and contract pricing reflects generative AI's massive high-performance memory requirements. This pressure is heavily compounded by hyperscale data center expansion, which now consumes a significant portion of global DRAM output. In this work, we propose a new architecture, Fiber Memory, which reimagines the role of optical fiber in a hyperscale data center, deploying it as an active, recirculating delay-line memory for immutable data, such as large language model weights. We present a hybrid data- and pipeline-parallel optical broadcast delay-line memory architecture that accounts for fiber's physical realities. By incorporating space-division multiplexed multi-core fibers, passive optical tap-and-amplify interfaces, co-packaged optics, and centralized in-ring 3R (re-amplify, reshape, retime) regeneration, our case study evaluation suggests that Fiber Memory can eliminate redundant weight storage across tens of thousands of AI accelerators and reduce weight-delivery power by over 75% compared to traditional HBM3e configurations.

cs.AR · cs.DC · cs.ET · cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.06286

Clear Human Web: Where a Person Vouches for Every Client

Lorenzo Porcelli

原文摘要

The web cannot tell whether a request comes from a person or from a program. Sites have checked the network address and puzzles in its place, and both have given way: automated traffic exceeds human traffic, and puzzles are solved for pay and by agents. This paper proposes the Clear Human Web, the part of the public web that sites open only to clients a person vouches for. A person's wallet presents their person identification data (PID) to one issuer, the only party that registers as a relying party, and receives a bounded number of blind-signed tokens, proofs of personhood that carry no attribute. The browser spends one token at each site that runs the gate, and the site learns that a valid token of a trusted issuer was spent, and nothing else. No field is added to the PID, no protocol is introduced, no site registers, and the publisher of a site holds the same proof as its readers. We define the Clear Human Web through five properties and seven adversaries, and state which properties the construction satisfies against each adversary. The identities a person can hold on one site in an epoch are bounded to k. The bound holds once the wallet limits a person to one pseudonym at the issuer. In the optimum k = 1, and a zero-knowledge proof of PID possession and a pseudonym per site replace the tokens.

cs.CR · cs.CY · cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.06225

Explainable Anomaly Detection in 5G Networks through Continuous Time Graphs

Thomas Hoger, Philippe Owezarski

原文摘要

5G networks increasingly resemble distributed systems in their design. It then becomes crucial to move beyond traditional network-based detection methods and to explore alternative approaches. In this work, we propose a formalization of 5G network exchanges as a dynamic graph, on which we apply techniques from the field of graph-based learning to detect anomalies effectively. This representation allows for fine-grained analysis of packet-level semantic content, while simultaneously capturing sequential and topological contexts, both of which are essential for identifying sophisticated and multi-stage attacks. To assess the effectiveness of this formalism, we evaluate it with the most popular dynamic graph models, demonstrating its potential for 5G anomaly detection.

cs.CR · cs.NE · cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.06186

Mobility-Aware Mobile Edge Computing for Energy-Balanced Data Collection in IoT-Enabled Underwater Sensor Networks

Nguyen Thi My Binh, Do Dinh Hoan, Tong Tien Manh, Vu Minh Yen, Dang Trong Hop, Ho Viet Duc Luong

原文摘要

Underwater wireless sensor networks (UWSNs) face critical challenges in energy imbalance, connectivity, and data collection due to harsh environments. To address these issues, this paper focuses on the problem is how to achieve energy-balanced data collection in IoT-enabled UWSNs with a mobility-aware mobile edge computing (MEC), named MECEBDC. Unlike existing approaches, the proposed scheme jointly optimizes energy-aware clustering, cluster head selection, and AUV-assisted data collection. Furthermore, we design a novel metaheuristic-based AUV routing algorithm that incorporates realistic underwater mobility dynamics, explicitly considering gravitational pressure and buoyancy forces acting on the AUV. By leveraging the computing, storage, and mobility capabilities of MEC-enabled AUVs, the proposed approach enables efficient trajectory planning and adaptive data gathering in a stable 3D underwater environment. Extensive simulations and theoretical analysis demonstrate that the proposed method significantly reduces node energy consumption, improves data collection efficiency, and prolongs network lifetime compared with existing schemes, making it well suited for long-term underwater IoT applications.

cs.NE · cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.05970

Ray-Tracing-Based Dynamic Channel Sounding With Autoregressive Wi-Fi CSI Prediction

Lyutianyang Zhang, Yixin Ying, Liu Cao, Vanlin Sathya, Jinke Ren, Shuguang Cui

原文摘要

Channel sounding in Wi-Fi multiple-input multiple-output (MIMO) systems must balance channel state information (CSI) accuracy against CSI acquisition overhead. Device mobility causes channel aging, while autoregressive CSI prediction introduces errors that accumulate over sounding intervals. However, standardized statistical channel models cannot fully capture the environment-specific channel dynamics encountered in physical artificial intelligence (AI) applications, motivating the use of Sionna-based ray tracing to evaluate CSI prediction under device mobility and evolving propagation geometry. This paper develops a dynamic sounding framework that integrates autoregressive CSI prediction with signal-to-interference-plus-noise ratio (SINR)-constrained interval selection. A Transformer with rotary position embedding that converts device positions into CSI sequences predicts CSI across multiple subcarriers for beamforming updates between sounding exchanges. We formulate sounding-interval selection as a predicted average-throughput maximization problem under per-stream SINR lower-bound constraints, including CSI acquisition and processing overhead. A prediction-error perturbation analysis provides the SINR bounds, and cumulative-sum enumeration globally solves the finite single-variable problem. Actual SINR feasibility holds whenever the prediction errors satisfy the bounds. Ray-tracing experiments assess channel prediction, trajectory transfer, and autoregressive prediction errors. In single-STA Wi-Fi 7 link-level simulations, predicted-CSI beamforming improves mean goodput by 67.3%, 112.7%, and 119.1% over stale CSI for linear, circular, and cosine trajectories, respectively.

cs.IT · cs.AI · cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.05832

StarWorld: A Cross-Layer World Model for Starlink Prediction and Streaming

Bowen Zhang, Pengcheng Luo, Hongjun Xie, Shujin Jia, Genke Yang, Jian Chu

原文摘要

Starlink and other low Earth orbit (LEO) satellite broadband systems exhibit stochastic access dynamics whose effects propagate from network measurements to throughput prediction and adaptive bitrate (ABR) streaming, making reasoning over multiple plausible futures essential. Existing studies mainly characterize realized traces or individual system layers, leaving cross-layer world modeling of these evolving dynamics largely unexplored. To address this gap, we propose StarWorld, a cross-layer world model for Starlink prediction and streaming. StarWorld couples learned stochastic network dynamics with executable prediction, control, and playback processes to imagine multi-step cross-layer futures, while a calibrated Trust Gate determines whether these futures are sufficiently reliable for use. On real Starlink measurements, StarWorld achieves the lowest network-future distributional errors among the comparison methods at the principal horizons and reduces pairwise controller quality-of-experience (QoE) effect error by 76%. These results support StarWorld as a cross-layer imagination environment for studying prediction and streaming outcomes under uncertain Starlink access conditions.

cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.05796

Optimization of Joint Beamforming in RIS-aided Multi-carrier and Multi-user MIMO Systems

Nuwan Balasuriya, Atefeh Termehchi, Ekram Hossain

原文摘要

Reconfigurable intelligent surface (RIS)-aided multiple-input multiple-output (MIMO) communication is a promising enabler for beyond-fifth-generation wireless networks. However, RIS phase shifters typically rely on a tuning element (for example a variable-length stub), which can be optimally configured for only one carrier frequency at a time. This constraint complicates RIS deployment in multi-carrier systems and often necessitates additional measures, such as using multiple RIS panels or partitioning RIS elements across carriers. In this work, we propose a novel scheme in which all RIS elements simultaneously serve multiple carriers, delivering improved performance over existing approaches. Our method leverages the multiple reflections captured by physically consistent RIS models to realize the desired phase shifts for all carriers using a single stub length setting. We further develop a joint active and passive beamforming optimization framework tailored to multi-carrier, physically consistent RIS-aided systems. Simulation results confirm the effectiveness of the proposed

cs.NI

查看论文
arXiv ↗PDF ↗
版本更新 · v2arXiv:2606.18170

The Multipath Reliable Connection (MRC) Transport

Rip Sohan, Eric Spada, Eric Davis, Mark Handley, Idan Burstein, Tony Hurson, Jithin Jose, Vivek Kashyap 等 39 位作者

原文摘要

MRC is an open, production-grade transport designed for large-scale AI/ML training over best-effort Ethernet. It extends RoCEv2 with explicit, composable primitives for per-packet multipath and sender-based congestion control, decouples packet delivery from semantic processing, adds multiple new capabilities for accelerated packet-loss recovery and adds resilience against port and path failures. This paper presents MRC and details its core capabilities and mechanisms.

cs.NI

查看论文
arXiv ↗PDF ↗
版本更新 · v4arXiv:2606.28079

GTI-mSEMP Framework : A Proposed Framework to Simulate Malware Propagation with Inclusion of Attacker-Defender Strategy

Shadeeb Hossain, Elias Calboreanu, Kristopher Wilson

原文摘要

The rapid proliferation of automated, multi-vector malware threats poses a significant risk to heterogeneous, resource constrained cyber-physical networks. Conventional epidemiological models often treat security defenses as static parameters, failing to capture the strategic, asymmetric maneuvers between an attacker and a defender. To address the gap, this paper proposes a Game-Theory-Integrated Modified Multi- Wireless Sensor Epidemic Malware Propagation (GTI-mSEMP) framework. This paper analyzed and compared the operational trajectories of Susceptible (S) and Recovered (R) node populations across three different operational regimes: Balanced Matchup, Exploit Surge and Hardened Defense. Numerical simulation results capture the real-time transient dynamics of the network state variables, demonstrating how the epidemic curve shifts when either the defensive or offensive scaling vectors hold an efficiency advantage. The proposed mathematical and numerical framework provides a rigorous foundation that can be deployed in highly adversarial network environments to evaluate dynamic malware propagation and predict localized node population states.

cs.CR · cs.GT · cs.NI

查看论文
arXiv ↗PDF ↗
版本更新 · v2arXiv:2608.07163

Rate-Fidelity Control for Wide-Area Quantum Links

Connor Clayton, Cory Nunn, Quinn Carmack, Wayne McKenzie, Anne Marie Richards, Xiaodi Wu, Bobby Bhattacharjee

原文摘要

Quantum network links must distribute entanglement at high rates while satisfying application-specified fidelity demands. However, wide-area deployed fiber links suffer from polarization drift which destabilizes end-to-end fidelity and forces periodic compensation. Current deployments often use active stabilization with fixed control policies, and improvements generally stem from advances in quantum hardware. Meanwhile, software control remains relatively underexplored. Here, we formulate quantum link operation as a joint control problem over tunable rate-fidelity tradeoffs and uncontrollable link drift. From this framework, we construct a link control protocol that dynamically adapts source pump power and polarization compensation to maximize entanglement distribution rate subject to a minimum fidelity constraint. We evaluate the protocol through trace-driven simulations driven by data from a 64 km deployed optical fiber. Compared with optimized static policies, our adaptive controller improves mean entanglement distribution rate by 14% over a 24 hour trace, without requiring any offline policy optimization. Our results show that software-based physical layer control can provide a practical mechanism for improving near-term quantum link performance without requiring additional quantum hardware.

quant-ph · cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.05550

Energy-efficient End-to-End Communication System with Spiking Neural Networks

Pooja Plavilayil Anil, Te-Chuan Chiu, Nguyen Van Huynh

原文摘要

2030 is expected to witness the first commercial 6G systems. However, traditional modular communication architectures cannot meet the latency, optimisation, and integration requirements demanded by various sub-millisecond, data-intensive emerging 6G applications. End-to-end (E2E) communication addresses these limitations by replacing traditional processing blocks with neural networks. Nevertheless, conventional artificial neural networks (ANNs) in E2E systems use dense computation. This results in substantial energy consumption and computational resource requirements, which may not be feasible in resource constrained devices. This paper addresses the aforementioned challenge by developing a spiking neural network (SNN) encoder that targets lower encoder inference energy while maintaining communication reliability. In particular, the SNN encoder combines sparse spike activity, sinusoidal temporal modulation, and weighted temporal aggregation to map one-hot encoded messages to distinguishable transmit signals. The model is evaluated across antenna configurations and SNN timesteps to investigate the bit error rate (BER)-energy trade-off. The simulation results show that the SNN encoder achieves comparable BER under suitable timestep selections, while reducing the average estimated encoder energy by 68.93%, 52.20%, and 35.69% for SNN timesteps 2, 3, and 4, respectively, across five antenna configurations. These findings highlight the potential of the proposed SNN encoder for energy-efficient E2E communication systems.

cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.05165

QPP-Aware MCX over Tactical Edge 3D Networks in Public-Safety Communications

José Oliveira, Pedro Valente, Tiago Mendes, André Vasconcelos, Tiago Fernandes, Rhyan Matos, Duarte Raposo, Pedro Rito 等 10 位作者

原文摘要

During disasters, public mobile networks may become unavailable, congested, or degraded, requiring deployable communication systems to support emergency operations. This article proposes a mission-critical communications system supporing Mission Critical Push-to-Talk (MCPTT), Mission Critical Video (MCVideo), and Mission Critical Data (MCData) over a private 5G standalone network with Non-Terrestrial Network (NTN) connectivity. A context-aware Quality, Priority, and Pre-emption (QPP) mechanism is proposed to dynamically adapt network resource allocation according to the operational state of Mission Critical Services (MCX). Extensions to the Open5GS Policy Control Function (PCF) and Session Management Function (SMF) enable priority and pre-emption updates for existing flows without session re-establishment. The architecture supports tactical edge deployment of service and media functions while retaining centralized service control. Experimental evaluation considers three configurations: terrestrial backhaul with centralized media processing, satellite backhaul with centralized media processing, and satellite backhaul with edge media processing. Results show that tactical edge processing reduces communication delay and packet loss. Under satellite backhaul, edge processing reduced the 95th-percentile MCPTT audio transport delay by 60.03 ms and packet loss by 9.42 percentage points, while achieving a 95th-percentile MCPTT access time of 184.52 ms. These findings demonstrate the benefits of tactical edge media processing and provide an experimental foundation for context-aware priority mechanisms in public-safety networks integrating terrestrial and non-terrestrial components.

cs.NI

查看论文
arXiv ↗PDF ↗
版本更新 · v3arXiv:2602.09994

ORCHID: Fairness-Aware Orchestration in Mission-Critical Air-Ground Integrated Networks

Chuan-Chi Lai, Chi Jai Choy

原文摘要

Uncrewed Aerial Vehicles (UAVs) provide on-demand wireless coverage for mission-critical Air-Ground Integrated Networks (AGINs). However, DRL-based orchestration faces challenges from multi-agent non-stationarity and the trade-off between energy efficiency (EE) and service fairness. To address these issues, we propose ORCHID (Orchestration of Resilient Coverage via Hybrid Intelligent Deployment), a stability-enhanced two-stage learning framework. First, GBS-aware topology partitioning provides a topology-informed warm start for UAV deployment. Second, a Reset-and-Finetune (R\&F) mechanism is integrated into Multi-Agent Proximal Policy Optimization (MAPPO) to support stable late-stage policy refinement through event-triggered rollback and learning-rate adaptation. To study the efficiency-fairness trade-off, ORCHID employs a Max-Min Fairness (MMF)-oriented bandwidth allocation based on a closed-form Egalitarian Bargaining Game (EBG) solution and is compared with Proportional Fairness (PF). Experiments show stronger served-user bottleneck-rate protection under MMF, together with competitive coverage and user-rate fairness and favorable energy-efficiency and UAV-load-balancing performance under zero-shot scalability and mobility tests. Overall, ORCHID provides an effective balance among user-level service protection, energy efficiency, and policy stability for resilient mission-critical UAV networks.

cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.05104

Workload-Static Optical Circuit Switching For Scalable LLM Inference Decode

Maximilian Thürmer, Nicolas Scotto di Perto, Eloise Stein, Natanijel Vasic, Mikaeil Bagherli, Zhenguo Wu, Benjamin Klenk, Holger Fröning 等 9 位作者

原文摘要

LLM inference decode executes fine-grained collectives whose latency directly limits per-user interactivity, yet scale-up fabrics are still built from electronic packet switches designed for training. We observe that, for a given model deployment and parallelization, the communication structure of decode is fixed, and propose workload-static optical circuit switching (OCS): circuits are configured once per deployment, co-designed with model parallelism and with topology-aware collective schedules that turn spare accelerator ports into fewer communication phases or higher bandwidth. We evaluate this design with GXNET, a graph-based workload emulator coupled to analytical and flit-level network models grounded in hardware measurements. In a 576-accelerator scale-up domain serving 5T-parameter MoE models with up to 5M tokens of context, all-OCS fabrics improve interactivity by up to 65% and energy efficiency by up to 119% over 4:1 oversubscribed packet-switched fabrics.

cs.DC · cs.AI · cs.AR · cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.05007

Throughput-Optimal Control of Distributed Computing Networks for Service DAGs

Peng Li, Jianan Zhang, Jaime Llorca, Xinzhe Fu, Xiang Cheng, Chen Chen

原文摘要

Executing service workflows with directed acyclic graph (DAG) dependencies over wireless distributed computing networks requires joint control of function placement, routing, and scheduling, together with synchronization of inputs from the same request at merge points. We study throughput-optimal control of these networks under stochastic request arrivals, time-varying wireless links, and interference constraints. We use a valid mapping abstraction that assigns each service function to a computation node and each DAG dependency to a routing path. Using this abstraction, we characterize the network capacity region to support service DAGs, and prove that synchronizing the packets of a request at merge points does not shrink the region. We develop Dynamic Computing Network Control for service DAGs (DCNC-DAG), a dynamic control policy that selects queue-aware valid mappings and schedules service DAG execution by nearest-to-origin (NTO) while enforcing input synchronization at merge points. With exact minimum-cost valid mappings, DCNC-DAG is throughput-optimal and ensures rate stability of the physical queues under bounded arrivals. These guarantees hold for any fixed finite interval between mapping updates, even when mapping decisions rely on boundedly stale queue length information. For larger service DAGs, we develop DCNC-DAG-H, which replaces exact mapping optimization with a queue-aware heuristic. Simulations show that DCNC-DAG supports $2.7\times$-$5.5\times$ the throughput of queue-blind baselines, while DCNC-DAG-H achieves up to $2.68\times$ those of the corresponding baselines on larger workflow and AI service DAGs.

cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.04973

Software Design Patterns for Latency Measurements with eBPF in SDN Environments

Pedro Lucas M. S. Rosa, Bruno L. Dalmazo, Leticia S. Machado, Jéferson Campos Nobre

原文摘要

This work proposes, implements, and evaluates a modular architecture based on software design patterns applied to latency measurement in Software-Defined Networks (SDN) using the Extended Berkeley Packet Filter (eBPF) and the Express Data Path (XDP). Unlike approaches that focus solely on measurement precision, this study examines how design patterns can structure observability systems in an extensible and maintainable way while preserving data-plane efficiency. The proposed architecture applies the Observer, Strategy, and Factory Method patterns to modularize the metric collection and analysis pipeline, allowing dynamic integration of policies and data sinks. The experimental environment was implemented with Mininet, Python agents, and eBPF/XDP programs, and was evaluated in terms of processing time, overhead, and evolution effort. The results show that the introduction of design patterns shows no clear evidence of measurable performance degradation, maintaining continuous measurements with a minimum of 5% overhead. The findings suggest that software engineering practices may be applied to the construction of eBPF-based monitoring and observability systems.

cs.PF · cs.NI · cs.SE

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.04744

Optimal (Randomized) Compact Routing Schemes

Shiri Chechik, Avi Kadria, Gur Lifshitz, Liam Roditty

原文摘要

Compact routing schemes route messages along short paths while every vertex stores little information. We study the trade-off between the stretch and the storage of compact routing schemes in undirected graphs, in four models: labeled and name-independent schemes, with average or worst-case local storage. We improve the best known stretch in all four models. Our main result is a labeled routing scheme with expected stretch $2k-1$ and $\widetilde O(n^{1/k})$ average local storage, in which only the routing is randomized. Under the Erdős girth conjecture, no scheme with this storage has stretch below $2k-1$, so our scheme is optimal, up to polylogarithmic factors in the storage. With deterministic routing, we obtain stretch $\approx2.47k$, the best known deterministic stretch with average storage. Worst-case local storage is the classical setting of compact routing. The leading coefficient $4$ in the stretch $4k-5$ of Thorup and Zwick~[SPAA'01] was improved only by Chechik~[PODC'13], to $\approx3.68$ in unweighted graphs. In unweighted graphs, we obtain expected stretch $(\frac83k+O(1),O(k))$, and deterministic stretch $\approx3.05k$. Name-independent routing is harder, since the source knows only the name of the destination. The best known stretch with $\widetilde O(n^{1/k})$ local storage in unweighted graphs was $96k$, by Abraham, Gavoille, and Malkhi~[DISC'04]. We improve it by more than a factor of $8$. With average storage, we obtain expected stretch $4k-5$, which matches the labeled scheme of Thorup and Zwick. With worst-case storage in unweighted graphs, we obtain expected stretch $(8k+O(1),O(k))$. All our schemes for unweighted graphs extend to weighted graphs with a small loss in the stretch, and still improve the previous unweighted bounds.

cs.DS · cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.04594

Rondo: Controlling Reordering in High-Throughput Packet Spraying

Xizhi Zhang, Zhongjie Chen, Yang Zhang, Fengyuan Ren

原文摘要

Modern datacenter applications demand high network bandwidth, motivating packet-level multipath transport to exploit the aggregate capacity of multiple paths. However, packet reordering under packet spraying poses challenges for hardware transports. Excessive packet reordering makes it difficult to infer packet loss, imposes substantial pressure on NIC resources, and ultimately degrades performance. Existing transports either prioritize throughput without controlling packet reordering, or mitigate reordering by restricting transmissions, which leaves available path capacity unused. In this paper, we identify two fundamental sources of packet reordering: transient inter-path queueing differences caused by control dynamics, and persistent path-delay differences due to path heterogeneity. These observations motivate a joint design of a multipath controller and a packet scheduler to address transient and persistent delay differences, respectively. We present Rondo, a packet-level multipath transport that achieves both high throughput and low packet reordering. Its multipath controller uses ACK-based per-path capacity estimation and probing to maintain stable path loads, while its packet scheduler adjusts packet transmission order to compensate for persistent delay differences. Testbed experiments and large-scale simulations show that Rondo reduces the maximum out-of-order degree by up to 97.5% while maintaining high throughput. With constrained receiver buffers, Rondo achieves up to 8.51 times higher goodput.

cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.04474

Hierarchical Intelligent Evolutionary Optimization for UAV-Assisted NOMA-MEC Systems

Yaxuan Jiao, Jiaxuan Lv, Jyoti Sahni, Wuyungerile Li, Winston K. G. Seah

原文摘要

The integration of unmanned aerial vehicles (UAVs), mobile edge computing (MEC) and non-orthogonal multiple access (NOMA) provides an effective solution for computation-intensive and latency-sensitive services in infrastructure-deficient environments. However, the joint optimization of UAV trajectories, task offloading, communication and computing resources under heterogeneous task priorities results in a highly coupled mixed-integer non-convex problem. To address these challenges, this paper proposes a Hierarchical Intelligent Evolutionary Algorithm (HIEA) for priority-aware multi-UAV cooperative NOMA-MEC networks, which integrates multi-head deep Q-network (MH-DQN)-based intelligent decision generation, communication-aware initialization, adaptive evolutionary exploration and successive convex approximation (SCA)-based precision refinement. Specifically, a novel communication-aware initialization mechanism, termed Channel Quality Indicator (CQI)-guided Load-Aware Trajectory Initialization (CQI-LATI), is designed to incorporate CQI and task workload characteristics into evolutionary population construction, generating high-quality and diversity-preserving initial populations. Theoretical analysis characterizes HIEA's search-space reduction, the quality-diversity trade-off of CQI-guided initialization, and the accuracy-efficiency trade-off of SCA refinement, and extensive simulations demonstrate that HIEA outperforms benchmark schemes, with gains of up to 6.5% in throughput, 13.6% in task completion rate and 15.3% in energy efficiency.

cs.NI · cs.LG

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.04408

Halley: A Predictive Control Plane for Optical AI Data Center Networks

Manav Mishra, Krishna M. Sivalingam

原文摘要

A frontier AI model is trained in an AI data center, on tens of thousands of accelerators joined by a dedicated network, and every training step ends with all of them exchanging data at once. Between racks, that network is optical, and each of its four layers, from lasers to switches, runs a fixed or after-the-fact policy. Lasers sharing an enclosure, cooling, and power can fail together. At a fixed spare ratio, correlated failure provably caps a pool's availability however large it grows. In this paper, we present a comprehensive predictive control plane framework, called Halley, that reads each resource's next state and acts before the failure occurs. It has four components, each carrying a formal guarantee: LightReserve that sizes the laser pool to provide a coverage bound, FoldFit that schedules the switch within $11/9$ of the optimal, ThermaLead that holds a microring with one-step-ahead control, and TriageGuard that protects the highest-risk modules first. Halley gives each layer a predictive controller that defers to the deployed policy when unsure. Composed from simulations at that point, effective goodput, the share of ideal throughput kept, rises from 65.2\% to 76.5\% if a window that exhausts its spares is lost. If only the dark channels' bandwidth is lost, it reaches 67.4\%. Per megawatt, that is up to 1.03--1.17 times the training; for the same training, up to 3.3--14.7\% less data center capacity. \textsf{Halley}'s fallback circuits are formally verified and are shown to achieve close timing on a commercial FPGA, and pass a 130~nm signoff.

cs.NI

查看论文
arXiv ↗PDF ↗
版本更新 · v2arXiv:2601.02694

Which Deep Learner? A Systematic Evaluation of Advanced Deep Forecasting Models Accuracy and Efficiency for Network Traffic Prediction

Eilaf M. A. Babai, Aalaa M. A. Babai, Koji Okamura

原文摘要

Network traffic prediction is an essential tool for automating modern network management. It is a difficult time series forecasting (TSF) problem that has been addressed by Deep Learning (DL) models due to their ability to capture complex patterns. Recent years have witnessed advances in deep forecasting models, from sophisticated transformer architectures to simple linear models, improving performance across diverse prediction tasks. However, given the diversity of these models, the variability of network traffic across environments and timescales, and the inherent challenges of network traffic prediction, it is essential to identify effective deployment choices and modeling directions. Henceforth, this study systematically identifies 12 deep forecasting models, comprising 8 advanced TSF models and 4 traditional deep learning architectures -- each with unique advantages for network traffic prediction -- against 3 statistical baselines, for a total of 15 forecasting methods and evaluate them on four real traffic datasets, across multiple time scales and horizons, assessing performance, robustness to anomalies, data gaps, external factors, data efficiency, and resource efficiency in terms of time, memory, and energy. Our results provide insights into model behaviour and guidelines for network management, highlighting performance regimes, efficiency thresholds, and promising architectures that balance accuracy, efficiency, and robustness to traffic challenges.

cs.NI · cs.LG

查看论文
arXiv ↗PDF ↗
版本更新 · v2arXiv:2512.15754

A Survey on Reconfigurable Intelligent Surfaces Towards Practical Deployments: Security and Privacy Perspectives

Ziyu Chen, Yitong Shen, Jingzhe Zhang, Yao Zheng, Yili Ren, Xuyu Wang, Shiwen Mao, Hanqing Guo

原文摘要

Reconfigurable Intelligent Surfaces (RIS) have emerged as a transformative technology capable of reshaping wireless environments through dynamic manipulation of electromagnetic waves. Although RISs have been widely studied for communication, sensing, and localization, their security and privacy implications are still fragmented across application-specific studies, prototypes, and testbeds. This survey provides a deployment-oriented review of RIS applications, with a focus on the security and privacy threats, vulnerabilities, and defensive strategies relevant to practical use. We analyze scenarios with two types of systems (with and without legitimate RIS) and two types of attackers (with and without malicious RIS), and clarify how RIS introduces new attack surfaces to practical systems, including eavesdropping, jamming, and spoofing attacks. In response, we review defenses against RIS-related attacks in these systems, such as protocol- and algorithm-level protections, unauthorized RIS detection, and interference/disruption-based mitigation. We also discuss scenarios in which the legitimate user applies an additional RIS to defend against attacks. To support future research, we also curate papers and available open resources at https://awesome-ris-security.github.io/. By highlighting RIS's functionality and its security/privacy challenges and opportunities, this survey aims to guide researchers and engineers toward the development of secure, resilient, and privacy-preserving RIS-enabled practical wireless systems and environments.

cs.CR · cs.NI · eess.SP

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.04128

Entanglement Allocation for Quantum Integrated Sensing and Communication

Shiva Kazemi Taskooh, Mehdi Monemi, Ekram Hossain, Georges Kaddoum, Mehdi Rasti

原文摘要

Jointly supporting communication and distributed sensing over a shared, limited pool of entanglement resources is an attractive prospect for future quantum networks. We develop a network-level quantum integrated sensing and communication (Q-ISAC) framework in which a quantum base station dynamically allocates elementary Bell pairs between communication users and distributed sensing. Sensing resources are adaptively partitioned among multiple GHZ probes with dynamically selected sizes and sensing-node assignments. We derive an effective quantum Fisher information model accounting for probabilistic fusion, transmission loss, and memory decoherence, and formulate a finite-horizon allocation problem subject to communication QoS, expected sensing-information, sensing-reliability, and hardware constraints. A hierarchical constrained proximal policy optimization (HC-PPO) framework combines learned discrete sensing allocation with analytical continuous communication allocation. Numerical results show that GHZ probing requires approximately $27$--30% fewer sensing qubits than separable probing under modest probe-size caps and 65-67% fewer at the highest considered target under the same sensing requirements. Adaptive multi-GHZ partitioning provides greater robustness than single-GHZ sensing, while adaptive communication--sensing sharing outperforms the evaluated fixed splits. The proposed HC-PPO framework satisfies the joint requirements in at least 99.9% of test instances across the considered sensing targets and fusion probabilities. Monte Carlo evaluation separately shows that realized terminal information reached its target in 96-98% of realizations, distinguishing expected-information satisfaction from realized sensing performance.

quant-ph · cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.04033

Exploring the Power Consumption of ERC-4337 Bundling on Server Infrastructure

Claudiu-Nicu Bărbieru, Oana-Otilia Captarencu, Pascal Felber, Emanuel Onica, Valerio Schiavoni, Cosmin-Nicolae Vârlan, Boris Verdecia Echarte

原文摘要

The Ethereum ecosystem offers the most widespread support for Decentralised Applications (DApps), with over 120 networks currently documented as using variants of the Ethereum Virtual Machine (EVM) for core execution logic. The ERC-4337 standard provides convenient access to DApps for users who do not possess the required cryptocurrency or prefer flexible authorisation of DApp actions. The infrastructure for ERC-4337 implementation can be deployed on any EVM network. However, to aggregate user requests and submit them to the EVM network, ERC-4337 requires operating a bundler, an additional component. Recently, the potential use of ERC-4337 was boosted by another standard, EIP-7702, which can enable ERC-4337 utility for any existing user account. However, the use of the combined EIP-7702/ERC-4337 pattern remains considerably low at less than 6% of EIP-7702 activity. We believe that this underutilisation is at least partly caused by the low number of existing bundling services and their popularity, currently fewer than 15 publicly documented. Expanding the number of bundler nodes would benefit the ecosystem but would introduce operational costs, part of which is represented by the added nodes' power consumption. In this paper, we provide a thorough view of the bundling power consumption aspect using server-grade infrastructure, evaluating both CPU and RAM consumption, as well as the overhead of container-based deployments specific to production environments.

cs.NI · cs.PF

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.04011

MusiSPARQ: Subscription-Aware Adaptive Resource Control for Musical Metaverse Services

Ali Al Housseini, Jaime Llorca, Omran Ayoub

原文摘要

The Musical Metaverse relies on distributed audio, visual, inference, and delivery functions deployed across heterogeneous edge-cloud resources. Queue-aware orchestration frameworks such as SPARQ jointly optimize service placement, routing, and resource allocation, but fix the execution regime of each resource in advance: it is either shared, favoring statistical multiplexing, or guaranteed, favoring performance isolation. This paper introduces MusiSPARQ, a subscription-aware control framework that promotes resource isolation from a fixed infrastructure attribute to a runtime decision. Each switchable resource is represented through coupled shared- and guaranteed-resource pools drawing from the same physical-capacity budget, and at each orchestration epoch the controller selects which class-specific service flows remain shared and which receive isolated capacity. The per-epoch decision jointly accounts for class-specific latency objectives, per-class maximum-latency limits, queueing stability, isolation cost, and switching overhead. In a dynamic virtual-concert scenario, MusiSPARQ reduces the Premium latency-target violation rate from 16.19% to 0.29% relative to fully shared execution, while reserving on average only 0.71% of capacity and, unlike static isolation, keeping Standard and Basic traffic within their latency targets.

cs.NI · eess.SY

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.03871

Survival-Time Risk Beyond Low-Order Channel Models: Identifiability and Scheduling

Ruifeng Zheng, Zhihan Xu, Pit Hofmann, Frank H. P. Fitzek

原文摘要

This paper investigates whether low-order packet-loss statistics suffice to assess survival-time risk under bursty packet losses, i.e., the probability that no update succeeds for a prescribed number of consecutive slots. Conventional models, such as the Gilbert model, characterize packet losses using the loss rate and mean burst length, but channels sharing these statistics may exhibit substantially different failure risks. We characterize the Markov channels one order above a given low-order fit that share its statistics and analyze their risks under acknowledgment-based scheduling with transmission budgets. We show that, with dense transmission attempts, risk is primarily governed by loss persistence beyond the modeled memory, and the worst-case channel need not be the most persistent one. Under limited budgets, retry spacing makes loss relapse probabilities important and can reverse the risk ordering of compatible channels. Numerical and measurement results show that low-order models can substantially underestimate the risk, highlighting the need for scheduling-dependent channel statistics.

cs.NI · cs.IT

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.03558

Quantum Private Information Retrieval on Forests

Mohamed Nomeir, Sennur Ulukus

原文摘要

We consider the problem of graph private information retrieval (PIR) in the quantum setting. We focus on a specific type of graphs, namely the forest graphs. A forest graph is a union of disjoint trees. We consider the quantum setting where all the servers share an entangled state. Each server is allowed to send only one qudit per retrieval round. We design a scheme for the forest graphs that achieves the rate of $\frac{3}{N}$. The scheme uses a GHZ state as the initial entangled state between the servers prior to the scheme initiation. We compare our scheme with the only work done in the literature that considered the quantum setting of graph PIR. We show that our scheme is more efficient in this setting. We derive the quantum capacity for the case of $G=3K_2$, which is equal to $4/6$. $G=3K_2$ is a special case of the forest graph. We design a scheme that is specialized for this graph, achieving a rate equal to $4/6$ and provide the corresponding matching upper bound, establishing it as the capacity.

cs.IT · cs.CR · cs.NI · eess.SP · quant-ph

查看论文
arXiv ↗PDF ↗
版本更新 · v2arXiv:2605.09481

TSNBench: Benchmarking LLM Proficiency in Time-Sensitive Networking

Rubi Debnath, Daniel Bujosa Mateu, Luxi Zhao, Silviu S. Craciunas, Paul Pop, Sebastian Steinhorst

原文摘要

We present TSNBench, the first benchmark for evaluating large language model (LLM) proficiency in Time-Sensitive Networking (TSN), a suite of IEEE 802.1 standards for deterministic communication with bounded latency in safety-critical domains such as autonomous vehicles, aviation, defense, and industrial automation. While LLMs have been extensively evaluated on general knowledge tasks, their capabilities in safety-critical networking domains remain largely unexplored. TSNBench comprises 939 expert-validated multiple-choice questions (MCQs) covering diverse TSN mechanisms, along with 100 open-ended Worst-Case Delay (WCD) computation tasks for each of Credit-Based Shaper (CBS) and Cyclic Queuing and Forwarding (CQF), across varying topologies and traffic flows. The ground-truth (GT) WCD values are computed using a verified Network Calculus (NC) solver for CBS and closed-form upper bounds for CQF. We evaluate 16 LLMs and find that although models achieve 67 to 95% accuracy on MCQs, they fail substantially on open-ended WCD computation. For CBS, the best-performing model, GPT-5, deviates from the GT by 150.2 $μ$s on average (mean absolute error, MAE), and its predicted WCD is within 50 $μ$s of the GT for only 39.4% of flows, while all other models exceed an MAE of 250 $μ$s. Providing the WCD equations in the prompt lowers the error for 9 of 10 models on CQF but only 2 of 9 on CBS. Such errors are large relative to TSN latency budgets and can lead to violations of real-time constraints and unsafe configurations. TSNBench demonstrates that MCQ benchmarks may overestimate LLM capabilities in safety-critical networking.

cs.NI

查看论文
arXiv ↗PDF ↗
新论文 · v1arXiv:2611.03406

From Reactive to Agentic Resilience: Multi-Timescale AI-RAN Orchestration Under Signaling Storms

Sotiris Chatzimiltis, Mahdi Boloursaz Mashhadi, Mohammad Shojafar, Rahim Tafazolli

原文摘要

Next-generation open radio access network (Open RAN) and AI-RAN deployments turn the RAN into a disaggregated, compute-aware platform whose service continuity depends on many control loops acting at different timescales. Resilience in this setting is best seen as a lifecycle spanning anticipation, absorption, adaptation, recovery, and evolution. Yet, existing mechanisms remain stage-specific and are rarely coordinated across the control hierarchy. This paper argues that agentic AI offers an orchestration layer that coordinates this lifecycle, turning operator intent into coordinated action while keeping slow language-model reasoning off the fast control path. Using mass-attachment signaling storms as a running study, we build a discrete-event Open RAN attach simulator that captures retry amplification, shared-compute contention, and non-instantaneous provisioning, and we propose a three-tier framework in which an orchestrator at the service management and orchestration layer sets a standing policy, a per-site non-real-time agent judges storms and anticipates scheduled crowds, and a deterministic near-real-time loop enforces every decision. Across experiments, the agentic controller approaches the resilience of a fully provisioned pool of servers at a quarter of its capacity by reading a scheduled event from a calendar and provisioning ahead of it. No reactive weight setting recovers this once the surge arrives. Free-text operator intents ground into control directives at 94% exact match on previously unseen intents, and a single instruction reshapes live behavior end to end. We also quantify the latency, cost, and contention limits that bound it. The supplementary material provides analytical proof of the derived Theorem on anticipation horizon, as well as the subsequent Corollary results on reactive provisioning limits.

cs.NI · cs.AI

查看论文
arXiv ↗PDF ↗