Abstract

Network slicing and Multiple-Access Edge Computing (MEC) are key technologies in fifth-generation (5G) networks. The flexible programmability of network slicing and the decentralization of MEC facilitate the deployment of Information-Centric Networking (ICN). The caching feature of ICN can provide users with low-latency data services. Although many existing works have addressed the cache deployment problem or the cache optimization problem, most of them do not consider the issue of caching resource allocation in the dynamic and hierarchical environment. Dynamic deployment of cache nodes can improve the operator’s revenue as much as possible while accurately allocating the caching resources can reduce the user-requested latency. Therefore, in this study, a problem of the operator’s expected revenue maximization is presented in an environment combining dynamic deployment of the MECs and the caching-enabled node ICN-Gateway (ICN-GW). To solve this problem, we propose an optimal stopping theory (OST)-based dynamic hierarchical caching resources allocation (ODH-CRA) algorithm. The algorithm consists of three parts. Firstly, an Integer Linear Programming (ILP) solution is proposed to determine the optimal deployment of the MECs. This method determines the optimal location and number of the MECs by considering deployment costs and service requirement costs synthetically. Secondly, a redeployment technique based on the OST is proposed to determine the best redeployment time of the MECs according to the values of latency violations and the service latency requirements. Finally, an improved elite genetic algorithm (IEGA) is proposed to find the optimal solution of the hierarchical caching resource allocation. This method searches the optimal scheme by maximizing the operator’s revenue joint caching costs and energy consumption. Ultimately, we perform a series of simulation experiments to compare the proposed method’s performance to dynamic and hierarchical methods. Our solution can effectively reduce the latency for users’ requesting, improve the revenue of ICN Communication Service Provider (ICSP), and provide an effective caching resource allocation scheme for the next generation of Internet of Things (IoT) networks.

Highlights

  • A Very low latency communication environment plays a vital role in the Internet of Things (IoT)

  • We propose an improved elite genetic algorithm (IEGA) to solve the hierarchical allocation problem of the internal caching resources of the operator, which can seek a set of optimal solutions to maximize the benefits of the ICN Communication Service Provider (ICSP)

  • We propose the dynamic hierarchical caching architecture shown in Fig. 2, which consists of the Information-Centric Networking (ICN) components such as ICN-Gateway (ICN-GW) and local ICN-DN consisting of the Multiple-Access Edge Computing (MEC)

Read more

Summary

INTRODUCTION

A Very low latency communication environment plays a vital role in the Internet of Things (IoT). This method could reduce the latency from users to the MEC nodes while ignoring the benefits of the operator These researchers have considered the dynamic deployment and hierarchical caching in ICN slices, there is a lack of comprehensive analysis between the service demand of ICNUE and the ICSP’s revenue in the 5G networks. By comparing with the existing articles, this paper studies the dynamic hierarchical caching resource allocation problem for the 5G-ICN slice to meet the latency demand of ICNUE and improve the income of the ICSP as much as possible. To this end, our work has made the following contributions: 1.

NETWORK ARCHITECTURE AND SYSTEM MODEL
SYSTEM MODEL
MEC DYNAMIC DEPLOYMENT
REVENUE MAXIMIZATION FUNCTION
REVENUE MAXIMIZATION ANALYSIS
OPTIMAL DEPLOYMENT OF MEC
OPTIMAL STOPPING THEORY
HIERARCHICAL CACHING RESOURCE ALLOCATION WITHIN THE ICSP
SIMULATION SETTINGS
FEASIBILITY ANALYSIS
IMPACT OF LATENCY VIOLATIONS
Best-availability
Findings
CONCLUSION AND FUTURE WORK
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call