Search arXivSearch

arXiv · 2203.15191

Idea and Theory of Particle Access

Abstract

Aiming at some problems existing in the current quality of service (QoS) mechanism of large-scale networks (i.e. poor scalability, coarse granularity for provided service levels, poor fairness between different service levels, and improving delay performance at the expense of sacrificing some resource utilization), the paper puts forward the idea and thoery of particle access. In the proposed particle access mechanism, the network first granulates the information flow (that is, the information flow is subdivided into information particles, each of which is given its corresponding attributes), and allocates access resources to the information particle group which is composed of all the information particles to be transmitted, so as to ensure that the occupied bandwidth resources is minimized on the premise of meeting the delay requirements of each information particle. Moreover, in the paper, the concepts of both information particle and information particle group are defined; Basic properties of the minimum reachable access bandwidth of an information particle group are analyzed; The influences of time attribute and attribute of bearing capacity of an information particle group on the minimum reachable access bandwidth are analyzed; Finally, an effective method for the calculation of the minimum reachable access bandwidth of an information particle group is given, and a particle access algorithm based on dynamically adjusting the minimum reachable access bandwidth is proposed. The research of the paper pave a new way for further improving QoS mechanisms of large-scale networks, and lay the corresponding theoretical foundation.

Explore related subjects

Keep this discovery

BibTeXRIS

Bo Li, Zhongjiang Yan, Mao Yang. 2026-09-03. Idea and Theory of Particle Access. https://arxiv.org/abs/2203.15191

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

AEGIS: Risk-Budgeted Online Scheduling for Resilient Continuous Edge Inference

Continuous edge inference requires sustained wireless and computing support across successive service instances. Under recurring channel degradation, transient edge overload, and multi-user contention, isolated deadline misses may accumulate into persistent service degradation. Existing schedulers mainly optimize instantaneous latency or per-timeslot utility and provide limited control over such cross-time effects. To address this issue, we propose AEGIS (Adaptive Exposure-Governed Inference Scheduling), a risk-budgeted online framework for service-level operational resilience. AEGIS regulates predicted deadline-risk exposure through dynamically replenished per-user risk budgets and establishes an explicit finite-horizon bound on cumulative admitted-risk exposure. One-step state estimation supports anticipatory delay and risk assessment, while the centralized bandwidth--computing allocation is transformed into an exact-potential formulation and solved through asynchronous coordinate updates. Simulation results demonstrate that AEGIS enhances timely-service continuity, contains persistent deadline violations, and improves post-stress recovery through adaptive cross-time risk regulation. Meanwhile, it effectively controls predicted-risk exposure while preserving competitive service performance, achieving a favorable balance between service resilience and risk control.

cs.NI

Enhancing Network Resilience via Graph-Based Anomaly Detection in Sovereign Functions

Sovereign network functions, e.g., routing protocols, are becoming increasingly complex and susceptible to failures arising from protocol configuration anomalies and anomalous configurations. This paper interprets the protocol configuration anomaly detection problem as detection of structural inconsistencies of connected nodes and edges in a bipartite graph that captures both physical network entities and logical protocol states. This graph structural inconsistency detector (GSID) model is proposed to solve the problem efficiently. To handle the heterogeneous nature of protocol configuration parameters, GSID employs an adaptive configuration encoder (ACE) that dynamically selects encoding strategies per parameter to preserve fine-grained numerical discrepancies. To expose the subtle inconsistencies of connected nodes and edges in the bipartite graph, GSID uses an inconsistency dynamic attention (IDA) mechanism that scores edges by drawing asymmetric attentions from both ends, rule compliance from one end and route connectivity from the other. It is demonstrated experimentally that GSID outperforms state-of-the-art baselines by threefold in F1 score and by 23.2% in accuracy. Ablation studies validate the effectiveness of both the ACE and IDA modules. Tests on unseen network scales and real-world network topologies show the superior adaptability of our GSID, compared to the baselines.

cs.NI