Networking and Internet Architecture
See recent articles
Showing new listings for Friday, 20 November 2026
- [1] arXiv:2611.25206 [pdf, html, other]
-
Title: Benchmarking Open-Source O-RAN and 5G NTN Stacks on Embedded ARM Platforms for Space PayloadsComments: 11 Pages, 6 Figures, 6 Tables. AeroconfSubjects: Networking and Internet Architecture (cs.NI); Performance (cs.PF)
Regenerative satellite payloads, which host the 5G Next Generation Node B (gNB) onboard instead of transparently relaying the radio signal, are a key building block of the Non-Terrestrial Network (NTN) integration that 3GPP started in Release 17. Combining them with the Open Radio Access Network (O-RAN) architecture adds software-defined control through RAN Intelligent Controllers (RICs), enabling in-orbit reconfiguration, multi-tenancy, and data-driven radio resource management. Open-source implementations make this vision accessible to research institutions and New Space missions, yet there is little quantitative evidence on how they behave on the embedded processors that a satellite can actually carry. This paper presents an out-of-the-box experimental benchmark of two open-source gNB stacks (i.e., OpenAirInterface/Duranta and srsRAN/OCUDU), and two Near-Real-Time RICs (i.e., the ORAN-SC Near-RT RIC and FlexRIC). All components are deployed on an ARMv8 platform representative of the processing units used in small-satellite payloads, driving a USRP B210 software-defined radio. We compare them in terms of functional compliance (3GPP NTN features, O-RAN interfaces, multi-tenancy), resource efficiency, real-time behavior, and engineering suitability. Results show that these platforms can host a joint gNB + near-RT RIC deployment using any of the considered components, although further optimizations are still required for carrier-grade performance. However, the performance and standards compliance vary significantly among them. Building on these results, we derive a decision framework that maps mission profiles and Size, Weight, and Power (SWaP) budgets to gNB/near-RT RIC combinations. Finally, we discuss the open gaps remaining before these stacks can be flown in NTN regenerative payloads.
- [2] arXiv:2611.25350 [pdf, html, other]
-
Title: SimPyWireless: A PHY-Aware Discrete-Event Simulation Framework for Wi-Fi and 5G NR-U Coexistence in the 5 GHz BandComments: 4 pages, 10 figuresSubjects: Networking and Internet Architecture (cs.NI)
The growing demand from heterogeneous wireless applications with stringent QoS and QoE requirements is increasing pressure on available spectrum resources. Although mmWave and THz bands offer additional capacity, their propagation and hardware limitations make sub-6~GHz unlicensed spectrum, particularly the 5~GHz band, an attractive complementary resource. However, reproducible Wi-Fi/5G NR-U coexistence studies remain limited by the lack of lightweight, open-source, PHY-aware simulation platforms. We present SimPyWireless, a discrete-event simulation framework for Wi-Fi and 5G NR-U coexistence in the 5~GHz unlicensed band. The framework integrates shared-channel modeling, propagation, interference, SINR, heterogeneous traffic, mobility, and technology-specific channel access, while providing modular support for externally trained AI/ML models. We validate SimPyWireless against an analytical DTMC model and demonstrate expected coexistence behavior under varying contention and mobility conditions. SimPyWireless provides a reproducible and extensible middle ground between analytical modeling and hardware-based experimentation.
- [3] arXiv:2611.25657 [pdf, html, other]
-
Title: Intent-Defined Radio: A Goal-Native Architecture for Next-Generation Wireless NetworksWencheng Yan (1), Binrui Xu (1), Yihao Shen (2), Zhiyuan Jiang (2), Sheng Zhou (1) ((1) Dept. of Electronic Engineering & BNRist, Tsinghua University, Beijing, China, (2) School of Communications and Information Engineering, Shanghai University, Shanghai, China)Comments: 7 pages, 4 figuresSubjects: Networking and Internet Architecture (cs.NI); Information Theory (cs.IT)
Wireless systems are becoming harder to operate because service goals are increasingly expressed in outcome-oriented terms, while radio platforms still expose mainly low-level configurations and protocol-specific controls. This mismatch makes it difficult to translate latency, reliability, throughput, and continuity requirements into coherent radio behavior. This article argues for Intent-Defined Radio (IDR) as a new system abstraction for next-generation wireless networks. Rather than treating the radio stack as a fixed mechanism set to be manually engineered and then tuned, IDR connects explicit service goals to executable radio behavior within a constrained design space by leveraging the capacity of large language models (LLMs). We position IDR relative to programmable radio, intent-based networking, and learning-based protocol design. We also present two simulation studies using Intent2MAC to illustrate the design loop, demonstrating executable MAC synthesis and offline refinement guided by evaluation feedback. The results show improved service satisfaction at a throughput cost and improved remote-control performance when random contention is replaced by distributed urgency-based arbitration. We finally discuss the open challenges in intent specification, evidence, hardware execution, interoperability, and lifecycle cost, and outline a staged path toward deployment.
- [4] arXiv:2611.25736 [pdf, html, other]
-
Title: An LLM-Driven Traffic-Control xApp for Dynamic 5G RAN IntentsSubjects: Networking and Internet Architecture (cs.NI); Artificial Intelligence (cs.AI)
Programmable Radio Access Networks (RANs) enable runtime deployment of traffic-control functions, but selecting the appropriate configuration remains challenging as network conditions and service requirements change over time. Conventional solutions often rely on static rules or learning-based controllers with predefined state and action spaces, limiting their ability to accommodate changing intents. This paper introduces an LLM-driven xApp for traffic control in programmable RANs. The proposed architecture combines operator-defined service intents, runtime E2 interface telemetry, and the currently deployed configuration to generate traffic-management policies without blocking packet forwarding or the processing of incoming E2 measurements during LLM inference. Experiments on an OpenAirInterface 5G environment show that the proposed controller dynamically adapts the traffic-control pipeline to runtime intent changes, achieving an average intent satisfaction ratio of 0.91, compared with 0.52 for a static TC-RAN configuration. When channel conditions degrade, the controller maintains an intent satisfaction ratio of approx. 0.88, compared with approx. 0.4 for the static baseline.
- [5] arXiv:2611.25837 [pdf, html, other]
-
Title: Software-Defined Internet Integration of Satellite Networks (SDISN)Subjects: Networking and Internet Architecture (cs.NI)
This paper proposes SDISN, a software-defined Internet integration of satellite networks. It facilitates the transmission of IP traffic from user terminals (UTs) or Internet nodes over a satellite network with inter-satellite links (ISLs). Gateways (GWs) together with Points of Presence (PoPs) support the transition between the satellite network and the Internet. UTs and GWs connect to the satellite network via serving satellites (SrvSats). As the satellites orbit the Earth at high speed, UTs and GWs frequently change their SrvSats. This causes frequent changes to their reachability, which poses a major challenge for integration.
In the proposed solution, GWs and SrvSats encapsulate traffic with forwarding information so that the traffic can be carried over the satellite network towards appropriate SrvSats of UTs or GWs. The forwarding information on the encapsulating nodes is continuously updated by a controller to reflect changed SrvSats and possibly changed topology of the satellite network. Design goals for the proposed architecture were low complexity on satellites, high ability for traffic engineering, and keeping UTs out of the routing system for security and compatibility reasons.
UTs may have increased security requirements (ISRs) such that their traffic should be carried within the constellation to avoid non-trusted terrestrial infrastructure. Extensions are proposed to support such ISRs. UTs may obtain either dynamic IP addresses from a nearby GW/PoP wherever they roam or they may obtain static IP addresses from a fixed Home GW/PoP. In the latter case, triangle routing via the Home GW occurs when the UT roams away from the Home GW. As this adds latency to the communication, we investigate architectural extensions for latency reduction. In addition, we show how traffic engineering can be performed in such an architecture with the help of alternate GWs and SrvSats. - [6] arXiv:2611.25984 [pdf, html, other]
-
Title: A Brief Overview of Non-Terrestrial Networks (Updated 2026)Subjects: Networking and Internet Architecture (cs.NI)
This article extends the 2023 preprint \emph{A brief introduction to satellite communications for Non-Terrestrial Networks (NTN)} (\href{https://arxiv.org/abs/2305.04590v1}{arXiv:2305.04590v1}) with a revision of its foundations, tables and state of the art as of 18 November 2026. It revisits propagation, link budgets, spectrum reuse and phased arrays, including corrected equations and numerical examples. Updated tables distinguish operational, launched and planned constellations and compare published fixed-terminal rates with direct-to-device services. The discussion incorporates developments in 3GPP Releases 17--20, commercial LTE-based direct-to-cell services and research towards 6G non-terrestrial networks. Operator announcements are distinguished from independent measurements and future plans. Open challenges include spectrum coordination, Doppler and timing compensation, mobility, capacity, security and the sustainability of low Earth orbit.
- [7] arXiv:2611.26086 [pdf, html, other]
-
Title: ScaleWire: An End-to-End Scale-Up Ethernet Simulation Framework for LLM SystemsComments: 7 pages, 8 figuresSubjects: Networking and Internet Architecture (cs.NI)
LLM training and inference rely on scale-up networks for high-bandwidth, low-latency memory-semantic communication among accelerators (XPUs). Ethernet is emerging as an open interconnect for scale-up systems. In Ethernet systems, network-interface (NI) mechanisms across transport, network, and link layers interact, jointly shaping communication performance and on-chip resource requirements. We present ScaleWire, an end-to-end scale-up Ethernet simulation framework for LLM systems. It couples packet-level simulation of cross-layer NI mechanisms with a resource exploration engine that combines analytical estimates and simulation to size on-chip resources. We validate ScaleWire against hardware measurements and nine analytical checks, and evaluate six NI designs across four LLM communication workloads. For DeepSeek-R1 dispatch, NI design choices lead to a 4.5$\times$ difference in per-XPU on-chip storage budget. In grid-comparison experiments, the exploration engine uses 6-19% of the simulations required by exhaustive search. Using vLLM prefill traces with kernel times measured on GH200 GPUs, ScaleWire further guides resource provisioning under a completion-time constraint for inference execution. ScaleWire thus helps designers select NI mechanisms and provision on-chip resources to balance communication performance and resource cost.
- [8] arXiv:2611.26134 [pdf, html, other]
-
Title: RouterWeave: A Unified Observation Layer for Cross-Platform Activity Analysis via Home RoutersComments: 17 pages, 7 figuresSubjects: Networking and Internet Architecture (cs.NI); Human-Computer Interaction (cs.HC)
Smart homes bring together devices from different operating systems and vendor ecosystems, but each platform reports activity only for the devices and features it supports, leaving gaps in household-wide activity monitoring. Interoperability standards such as Matter and software integrations connect and control supported devices, yet vendor restrictions and licensing barriers limit access to their data, while hardware constraints hinder integration. Our key insight is that encrypted network traffic provides complementary evidence of activity across platform boundaries. Accordingly, we present RouterWeave, a router-side observation framework that combines cross-platform traffic collection, task-adaptive processing, and unified activity records. These records preserve activity meaning, temporal extent, and source-device attribution while distinguishing discrete operations from sustained activity intervals. We evaluate RouterWeave across four datasets, native execution on a commodity home router, and two novel case studies: cross-platform Screen Time monitoring and appliance energy estimation. RouterWeave achieves 94.41% macro-F1 on application activities and 97.46% on IoT operations, outperforming baselines by up to 20.99 percentage points, while using under 7 MB of router memory per task and supporting 54 concurrent devices within a 5-second update window. In end-to-end case studies, RouterWeave reconstructs 600 Screen Time timelines across Android, iOS, and Windows with 92.15% accuracy (24.84-second mean active-time error over 19-minute averages) and recovers 49 of 55 appliance operations over four days, tracking ON/OFF states with 92.84% agreement and estimating electricity use within a 4.28% error. Together, these results establish the commodity home router as practical infrastructure for whole-home activity sensing. The code is open sourced at this https URL.
- [9] arXiv:2611.26156 [pdf, html, other]
-
Title: Towards Scale-Up Networking: Challenges and Open QuestionsTingting Xu, Zixun Su, Xinyang Huang, Bowen Liu, Kun Tan, Dong Lin, Hao Wang, Yinben Xia, Weifeng Zhang, Binzhang Fu, Shuihai Hu, Kai ChenSubjects: Networking and Internet Architecture (cs.NI); Distributed, Parallel, and Cluster Computing (cs.DC)
The rapid growth of AI models and the widespread use of distributed training and inference have made inter-accelerator communication a critical system bottleneck. Scale-up fabrics address this bottleneck by combining high per-accelerator bandwidth with low and predictable latency over tightly coupled accelerator domains. However, the appropriate topology, protocol mechanisms, communication semantics, and system integration remain actively debated. We analyze the critical-path communication generated by parallelism strategies and derive the resulting requirements for domain scale, per-accelerator bandwidth, and collective completion latency. We then use these requirements as a framework to examine representative proprietary and open scale-up fabrics, revealing how their physical interconnects, topologies, protocols, and semantics make different trade-offs among performance, scalability, compatibility, and implementation cost. Moreover, based on this analysis and discussions with industry experts, we identify challenges and open problems in physical interconnects and switching, efficient communication, semantics, resource sharing and heterogeneous device interconnection. This paper provides a requirement-driven foundation for analyzing current scale-up fabrics and guiding the design of future systems.
New submissions (showing 9 of 9 entries)
- [10] arXiv:2603.18604 (replaced) [pdf, html, other]
-
Title: xAppGen: LLM-driven Natural Language Programming for Agile xApp DevelopmentSubjects: Networking and Internet Architecture (cs.NI); Artificial Intelligence (cs.AI)
Traditional RAN systems are closed and monolithic, stifling innovation. The openness and programmability enabled by Open Radio Access Network (O-RAN) are envisioned to revolutionize cellular networks with control-plane applications--xApps. The development of xApps (typically by third-party developers), however, remains time-consuming and cumbersome, often requiring months of manual coding and integration, which hinders the roll-out of new functionalities in practice. To lower the barrier of xApp development for both developers and network operators, we present xAppGen, the first LLM-driven natural language programming framework for agile xApps that automates the entire xApp development pipeline. In a nutshell, xAppGen turns high-level user intents into swiftly deployable xApps within minutes, eliminating the need for manual coding or testing. To this end, AutORAN builds a fully automated xApp generation pipeline, which integrates multiple functional modules (from user requirement elicitation, AI/ML function design and validation, to xApp synthesis and deployment). We design, implement, and comprehensively evaluate xAppGen on representative xApp tasks. Results show xAppGen-generated xApps can achieve similar or even better performance than the best known hand-crafted baselines. xAppGen drastically accelerates the xApp development cycle (from user intent elicitation to roll-out), streamlining O-RAN innovation.
- [11] arXiv:2606.06261 (replaced) [pdf, html, other]
-
Title: DAST: A VLM-LLM Framework for Cross-Interface Anomaly Detection in O-RANComments: 7 pages, 5 figures. This work has been submitted to the IEEE for possible publicationSubjects: Networking and Internet Architecture (cs.NI); Artificial Intelligence (cs.AI); Emerging Technologies (cs.ET); Multiagent Systems (cs.MA)
O-RAN enables a disaggregated baseband stack with programmable functions that communicate over standardized open interfaces. The same openness that enables multi-vendor composition also expands the attack surface across logically decoupled tiers that make up the compute continuum. Among these threats, Denial-of-Service and performance-degradation attacks, which account for the majority of catalogued O-RAN threats, are particularly difficult to detect. Traditional Time-Series Anomaly Detection (TSAD) methods fail in this new regime where labelled baselines are scarce, threats evolve faster than detectors can be retrained, and the high-dimensional multivariate telemetry overwhelms monolithic inference models. To address these challenges, we present DAST, a zero-shot multi-agent framework for cross-interface anomaly detection in O-RAN that chains a three-stage VLM $\rightarrow$ LLM $\rightarrow$ VLM pipeline. DAST converts multivariate KPI streams into visual representations, scores textual per-interface descriptions against O-RAN domain knowledge, and verifies suspects on high-resolution heatmaps to output the problematic interfaces, the anomalous time intervals, an indicative O-RAN WG11-aligned operational impact rating and the decision rationale. We evaluate DAST on real network traces collected from an O-RAN testbed under representative performance degradation scenarios, achieving 0.910 F1-Score and 0.843 Accuracy, outperforming state-of-the-art TSAD baselines.
- [12] arXiv:2607.18935 (replaced) [pdf, other]
-
Title: Online Stochastic Matchings: Stability on HypergraphsFabien Mathieu (NPA)Subjects: Networking and Internet Architecture (cs.NI)
In stochastic dynamic matching, items of several classes arrive at rates $\lambda$ and leave in compatible groups. When groups may exceed two items, as in quantum switches or organ exchange, compatibility is described by the incidence matrix $A$ of a hypergraph, whose entries count how many items of each class a group consumes (single-class hyperedges can model discards). We call a system stabilizable if some matching policy keeps large queues rare in the long run, and show that this holds if and only if the conservation equation $A\mu = \lambda$ admits a nonnegative solution whose support induces a surjective submatrix. Equivalently, $\lambda$ lies in the interior of the cone generated by the hyperedges. The condition is necessary for all policies, including idling and clairvoyant ones. It is sufficient through one explicit policy: the rewardless counterpart of the Extended Greedy Primal--Dual policy of Nazari and Stolyar (2019) stabilizes every stabilizable system without knowledge of the rates, and its mean queue length is explicitly bounded. Approaching a solution whose support is not surjective has a cost, under every policy: matching rates within $\epsilon$ of it force mean queues of order at least $1/\epsilon$. On simple graphs, some greedy policies stabilize every stabilizable system. On a small hypergraph with a single hyperedge of size three, every greedy policy is unstable on an open set of stabilizable rates. This shows that no greedy policy, nor any family of greedy policies, can approach maximal stability on hypergraphs: idling is necessary. We also settle two cases explicitly: the complete $k$-uniform hypergraph (the $k$-partite quantum switch), which is stabilizable exactly when no link generates a fraction $1/k$ or more of the total rate, and the Fano plane.
- [13] arXiv:2611.14961 (replaced) [pdf, html, other]
-
Title: CommJEPA: When Predictive Representation Learning Meets Wireless IntelligenceSubjects: Networking and Internet Architecture (cs.NI)
Artificial intelligence (AI) is becoming an integral part of wireless systems, yet much of today's wireless AI remains task-specific and reactive, with models typically trained to map current observations to predefined outputs or reconstruct observed data. While effective for individual tasks, such approaches provide limited support for learning what is predictable, reusable, and transferable in dynamic wireless environments. Joint-Embedding Predictive Architecture (JEPA) offers a different perspective by learning predictive representations in latent space that capture informative structure in the observations. In this article, we introduce Communication JEPA (CommJEPA) as a communication-oriented framework for predictive representation learning. The central idea is bidirectional. JEPA can equip wireless systems with predictive representations for capturing latent channel and environmental dynamics, integrating heterogeneous observations, adapting to changing conditions, and supporting future decisions. Conversely, the physical structure, partial observability, multiple time scales, action-dependent evolution, and resource constraints of wireless systems motivate new communication-aware JEPA designs. We develop this mutual perspective, organize the resulting design space, and discuss representative JEPA-based wireless instantiations for prediction and control. We further highlight open challenges toward scalable, interactive, and predictive wireless intelligence.