Searcharxiv⌕ Search

arXiv · 2609.32168

A Priority-Aware Dual-Channel Feature Fusion Method for Urban Rail Service Traffic Classification

Abstract

With the deep integration of 5G and IoT in urban rail transit, service traffic grows explosively and accurate classification of heterogeneous service flows is essential for safe and efficient railway operations. Urban rail communication systems are subject not only to operational disturbances such as equipment failures and maintenance interference, but also to complex transmission patterns characterized by the interleaving of multi-service traffic flows. Under these operating conditions, the widespread deployment of proprietary protocols and the high prevalence of encrypted traffic further diminish the applicability of conventional port-based and Deep Packet Inspection (DPI) classification methods. To address these challenges, we propose a priority-aware dual-channel feature fusion framework. Raw traffic bytes and statistical features are mapped into grayscale images and processed by a dual-branch architecture: a transfer learning-enhanced ResNet extracts fine-grained byte-level textures, while a lightweight CNN captures macroscopic statistical patterns. A channel attention mechanism dynamically recalibrates cross-modal features, and a novel Priority-Sensitive Loss (PSL) that integrates business-criticality awareness with class-balance weighting to maximize recall for safety-critical services. Evaluated on a real-world urban rail dataset using priority-weighted metrics, the method achieves 98.74\% accuracy and 99.24\% weighted recall, with recall of 99.94\% and 99.41\% on the two safety-critical services:Communication-Based Train Control(CBTC) and Emergency Radio Dispatch(ERD), providing a reliable classification foundation for priority-aware resource scheduling in urban rail communications. With only 0.18M parameters and 0.4--0.7 ms end-to-end latency, offering an excellent balance between high-precision classification, low inference latency, and edge-deployment feasibility.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xinpeng Liu, Junhui Zhao, Zhengyuan Wu, Huaicheng Li. 2026-09-26. A Priority-Aware Dual-Channel Feature Fusion Method for Urban Rail Service Traffic Classification. https://arxiv.org/abs/2609.32168

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

KEEP EXPLORING

Related papers

Control Data Scheduling over Shared Communication Channels: A Sparse and Collision-Free Mechanism

In systems where controllers operate remotely and communicate with actuators over shared communication channels, it is crucial to efficiently schedule the control data transmission to reduce bandwidth usage and actuator effort. In this article, we investigate a novel scheduling mechanism that jointly coordinates control actions across different controllers and different time steps. We propose an algorithm based on the alternating direction method of multipliers (ADMM) to solve the resulting optimization problem. While ADMM is often treated as a black-box solver, the proposed algorithm offers a clear physical interpretation, ensures convergence to a stationary point, and is computationally efficient. Simulation results validate our theoretical results and demonstrate the effectiveness of our proposed algorithm.

eess.SY↗

Discrete-time polynomial systems with inputs and outputs: structure, reachability, observability, and minimal realizations

We study the realization problem for discrete-time input/output polynomial systems. These are formalized using tools from commutative algebra and algebraic geometry as systems whose state spaces are algebraic varieties, or more abstractly the set of k-points of an affine k-scheme, where k is an arbitrary infinite field. The input/output behaviors of such systems are described by "polynomial response maps" in which outputs are polynomial functions of past inputs. The main results show that every polynomial response map admits a canonical (quasi-reachable and algebraically observable) realization, which is unique up to isomorphism. The key to the approach is to linearize dynamics by considering a "dual" system in which states are functions defined on states. Finite dimensionality of the canonical realization, and its polynomiality, are characterized in terms of the space, algebra, and field of observables of the map, as well as in terms of algebraic input/output difference equations, and by a Jacobian rank criterion. A particular subclass consists of the maps that we call "bounded," defined by the property that their degree in the past inputs is uniformly bounded. Bounded maps are shown to be finitely realizable if and only if they are realizable by finite-dimensional state-affine systems, whose theory in turn reduces to that of rational formal power series. We also study the lattice of quasi-reachable realizations of a given map, including normal realizations. This work is an update of the PhD thesis written by the author in 1976; connections to recent work are briefly discussed in the last section.

eess.SY↗

Massachusetts' 2026 Clean Peak Standard Recalibration: Adaptation and Storage Tradeoffs

Massachusetts recalibrated its Clean Peak Standard (CPS) in 2026 by lowering the minimum standards and expanding the Near-Term Resource Multiplier for qualifying storage. This paper evaluates the change using a three-zone, hourly capacity expansion model for 2026--2030. Both scenarios achieve full CPS compliance, but the post-May scenario reduces new battery additions by 53.1% and modeled system cost by 3.7%. CPS-eligible discharge declines by 30.4%, while Clean Peak Energy Certificate production declines by only 9.5%. Fossil generation during CPS hours increases by 11.7%, whereas modeled emissions remain nearly unchanged because the Regional Greenhouse Gas Initiative cap binds. The recalibration therefore lowers the modeled storage capacity requirement while weakening physical clean-peak performance.

eess.SY↗