Search arXivSearch

arXiv · 2203.16221

On the Performance of Co-existence between Public eMBB and Non-public URLLC Networks

Abstract

To ensure the high level of automation required in today's industrial applications, next-generation wireless networks must enable real-time control and automation of dynamic processes with the requirements of extreme low-latency and ultra-reliable communications. In this paper, we provide a performance assessment for the co-existence of a public enhanced mobile broadband (eMBB) and a local non-public factory (URLLC) network and evaluate the network conditions under which the stringent latency and reliability requirements of factory automation applications are met. The evaluations consider both an unsynchronized and a synchronized time division duplexing (TDD) deployment between the networks, as well as scenarios both with and without any macro eMBB traffic located inside the factory. The results show that an unsynchronized deployment is possible if the isolation between the networks is sufficiently high, either as a result of a separation distance, wall loss or the use of separate frequencies for the networks. A synchronized deployment will avoid the cross-link interference, but it will not resolve the problems related to the closed access and the near-far interference. If the factory contains eMBB traffic served by the overlaid macro cells, the performance of both networks will suffer due to a high level of cross-link and near-far interference. The problems related to the cross-link interference can be resolved by synchronizing the networks, while the level of the near-far interference can be reduced by allowing the eMBB users to be connected to base stations located inside the factory. Finally, if an unsynchronized deployment is desired, the factory should be deployed on an isolated frequency.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yanpeng Yang, Kimmo Hiltunen, Fedor Chernogorov. 2022-03-30. On the Performance of Co-existence between Public eMBB and Non-public URLLC Networks. https://arxiv.org/abs/2203.16221

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

KEEP EXPLORING

Related papers

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI

Pattern-Aware Virtual Network Embedding Optimization for Cloud Data Centers

The network virtualization (NV) technology has enabled the sharing of multiple resources among virtual networks (VNs) in cloud data centers. One of the key challenges is to allocate resources in real-time for virtual network request (VNR), which is known as online virtual network embedding (VNE). However, the existing online VNE methods do not exploit the multi-dimensional complementary relationship among diverse VNRs, resulting in the fragmentation and waste of substrate resources. In this paper, we propose the pattern matching based online VNE approach by constructing appropriate matching rules among observed patterns to maximize resources utilization. We devise the clustering based VNRs quantization method and conduct rigorous study on the pattern combination filtering problem. Then, we utilize the column generation to solve it and construct the pattern matching rules. Based on the rules, we propose an online pattern matching VNE algorithm with linear worst-case complexity. Evaluation on a 106-server testbed using Alibaba production cluster trace dataset shows that our algorithm achieves close-to-offline performance and more accepted workloads that outperforms traditional designs by 25%-30%.

cs.NI