Near-optimal Cloud-Network Integrated Resource Allocation for Latency-Sensitive B5G

TL;DR

This paper addresses the complex problem of joint resource allocation in cloud-network infrastructures for latency-sensitive B5G services, proposing models and algorithms to optimize VNF placement, traffic, and path selection.

Contribution

It introduces a comprehensive non-linear programming model for CCRA and presents two algorithms, B&B-CCRA and WF-CCRA, for optimal and near-optimal solutions.

Findings

B extbackslash{}&B-CCRA achieves optimal solutions.

WF-CCRA provides near-optimal solutions faster.

Algorithms effectively handle capacity, delay, and QoS constraints.

Abstract

Nowadays, while the demand for capacity continues to expand, the blossoming of Internet of Everything is bringing in a paradigm shift to new perceptions of communication networks, ushering in a plethora of totally unique services. To provide these services, Virtual Network Functions (VNFs) must be established and reachable by end-users, which will generate and consume massive volumes of data that must be processed locally for service responsiveness and scalability. For this to be realized, a solid cloud-network Integrated infrastructure is a necessity, and since cloud and network domains would be diverse in terms of characteristics but limited in terms of capability, communication and computing resources should be jointly controlled to unleash its full potential. Although several innovative methods have been proposed to allocate the resources, most of them either ignored network resources or relaxed the network as a simple graph, which are not applicable to Beyond 5G because of its dynamism and stringent QoS requirements. This paper fills in the gap by studying the joint problem of communication and computing resource allocation, dubbed CCRA, including VNF placement and assignment, traffic prioritization, and path selection considering capacity constraints as well as link and queuing delays, with the goal of minimizing overall cost. We formulate the problem as a non-linear programming model, and propose two approaches, dubbed B\&B-CCRA and WF-CCRA respectively, based on the Branch \& Bound and Water-Filling algorithms. Numerical simulations show that B\&B-CCRA can solve the problem optimally, whereas WF-CCRA can provide near-optimal solutions in significantly less time.