Search arXivSearch

arXiv · 2501.04267

A 5G-Edge Architecture for Computational Offloading of Computer Vision Applications

Abstract

Processing computer vision applications (CVA) on mobile devices is challenging due to limited battery life and computing power. While cloud-based remote processing of CVA offers abundant computational resources, it introduces latency issues that can hinder real-time applications. To overcome this problem, computational offloading to edge servers has been adopted by industry and academic research. Furthermore, 5G access can also benefit CVA with lower latency and higher bandwidth than previous cellular generations. As the number of Mobile Operators and Internet Service providers relying on 5G access is growing, it is of paramount importance to elaborate a solution for supporting real time applications with the assistance of the edge computing. Besides that, open-source based platforms for Multi-access Edge Computing (MEC) and 5G core can be deployed to rapid prototyping and testing applications. This paper aims at providing an end-to-end solution of open-source MEC and 5G Core platforms along with a commercial 5G Radio. We first conceived a 5G-edge computing environment to assist near to user processing of computer vision applications. Then a sentiment analysis application is developed and integrated to the proposed 5G-Edge architecture. Finally, we conducted a performance evaluation of the proposed solution and compare it against a remote cloud-based approach in order to highlight the benefits of our proposal. The proposed architecture achieved a 260\% throughput performance increase and reduced response time by 71.3\% compared to the remote-cloud-based offloading.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcelo V. B. da Silva, Maria Barbosa, Anderson Queiroz, Kelvin L. Dias. 2025-01-08. A 5G-Edge Architecture for Computational Offloading of Computer Vision Applications. https://arxiv.org/abs/2501.04267

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