Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.22095

QoS-Aware Service Restoration in 5G Optical Transport Networks

Zahra Sharifi Soltani·Arash Rezaee·Orlando Arias·Vinod M Vokkarane
View original source ↗Read source document ↗Export metadata ↓

Abstract

Only the chairs can edit The rapid growth of high-bandwidth applications in fifth-generation (5G) networks and beyond has driven a substantial increase in traffic within transport optical networks. While network slicing effectively addresses diverse quality of service (QoS) requirements-including bit rate, latency, and reliability-it also amplifies vulnerabilities to failures, particularly when a single disruption in the optical layer impacts multiple services within the 5G network. To address these challenges, we propose a Fast Disrupted Service Prioritization (FDSP) algorithm that strategically allocates resources to the most critical disrupted services. Specifically, FDSP employs a fast-solving integer linear programming (ILP) model to evaluate three key factors-service priority, bit rate, and remaining holding time-and integrates a physical-layer impairment (PLI)-aware routing and spectrum allocation approach. By leveraging this combined strategy, FDSP minimizes service disruption while optimizing resource utilization. Simulation results on Germany's network demonstrate that our approach significantly enhances the reliability and efficiency of survivable 5G slicing, thereby reducing blocking probability.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zahra Sharifi Soltani, Arash Rezaee, Orlando Arias, Vinod M Vokkarane. 2025-03-28. QoS-Aware Service Restoration in 5G Optical Transport Networks. https://arxiv.org/abs/2503.22095

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

KEEP EXPLORING

Related papers

arXiv2026

Toward an Unbiased Collective Memory for Efficient LLM-Based Agentic 6G Cross-Domain Management

Agentic artificial intelligence is a candidate enabler of Level-4 autonomy in sixth-generation (6G) networks, but agents reasoning over a shared memory inherit its distortions. We study cross-domain radio access network (RAN)--edge orchestration in which a RAN agent minimizing energy and an edge agent minimizing latency negotiate, validate proposals against a digital twin (DT), and share a collective memory. Such a memory is a sampling device: what agents retrieve, not what they store, determines what they do. We define the Retrieval Bias Index, a divergence between the induced retrieval law and a representative reference, decomposed along temporal, confirmation and availability axes, and show that additive retrieval scoring is an exponential tilt of the undebiased law, yielding a closed form for the failure-amplification weight and a saturation floor set by the store's own composition; a further result bounds excess service level agreement (SLA) violation additively in retrieval bias and DT mismatch. On a tandem queue for which stochastic network calculus supplies a feasible region, an oracle and a Nash bargaining reference, the operator attains a $12.7\times$ bias reduction over a recency store and the smallest distance to the bargaining solution among six memory architectures.

cs.NI↗
arXiv2026

Stage-Aware Communication Scheduling for Disaggregated LLM Serving

Meeting stringent Time-To-First-Token (TTFT) requirements is crucial for LLM applications. To improve efficiency, modern LLM serving systems adopt disaggregated architectures with diverse parallelisms, introducing complex multi-stage workflows involving reusable KV-block retrieval, collective communication, and P2D transfer. Flows from dependent stages overlap within and across requests on shared bottleneck links, making TTFT highly susceptible to network contention and necessitating stage-aware scheduling. Unfortunately, most existing works schedule flows in a stage-agnostic manner, leading to uncoordinated contention that constitutes a primary cause of SLO violations. In this paper, we present Nuska, a holistic multi-stage flow scheduling mechanism designed to maximize TTFT SLO attainment. At its core, Nuska approximates the Least-Laxity-First (LLF) scheduling policy without requiring precise knowledge of a request's remaining slack. It achieves this through a Defer-and-Promote principle implemented through a Reverse Multi-Level Queue (RMLQ) structure. By dynamically promoting task precedence as effective laxity diminishes, Nuska prioritizes flows with less laxity while preventing requests with loose SLOs from prematurely consuming network bandwidth. We implement Nuska as a pluggable module integrated into vLLM, and evaluate it on an 8-server, 32-GPU testbed as well as through large-scale simulations. Our results demonstrate that Nuska effectively outperforms state-of-the-art baselines, improving the TTFT SLO attainment by 1.2x-2.4x.

cs.NI↗
arXiv2026

ANI-Gamut: Benchmarking Agent Reliability across the Gamut of Agent-Network Interface Abstractions

Large Language Model (LLM) agents are increasingly trusted to operate live networks: they read state, change configuration, and verify the result. A first-order question is left implicit: at which level of abstraction should the agent operate? We make the interface-abstraction level an explicit, controlled experimental variable, organizing agent-network interfaces into a spectrum from raw CLI (A0) through bounded wrappers (A1) and standardized model-driven configuration (A2) to typed transactional service intent (A3-T), reconciled source-of-truth automation (A3-R), and their combination (A4). We present ANI-Gamut, a reproducible, open-source playground that exposes the same task at several levels on a single, densely populated brownfield substrate, where many coexisting services share resources and collateral damage actually arises. We instantiate and measure four points of the spectrum and describe the others only at the conceptual level, and record three dependent variables as the substrate is stressed by injected faults: task reliability, collateral damage against pre-existing tenants, and operational cost. In a pilot with small run counts (n=20, n=6 and n=4 per level), the interface level moves reliability and cost sharply: on a live change-set task a raw-shell agent fails on all six seeds while a typed transactional interface succeeds on all six (paired McNemar p=0.031, on six discordant pairs), at roughly an order of magnitude less cost, as the engineering effort migrates from the agent to a reusable transaction layer. Collateral damage, by contrast, is absent at every level, whether benign or under faults: in a tenant-isolated substrate the agents fail safe, and the blast radius is held by the substrate's isolation, which moves the safety question from the agent to the substrate.

cs.NI↗