Wireless Network Virtualization Resource Sharing Based on Dynamic Resource Allocation Algorithm

Abstract

In recent years, with the continuous development of IT industry, network virtualization technology has gradually developed into a hotspot of research and application in the field of communication because IT allows the construction of customized virtual network (VN) on shared physical infrastructure. In particular, the proposal of wireless network virtualization for the development of the enhanced Internet. Because these technologies require effective algorithms named virtual network mapping (VNE) to instantiate virtual networks on the SN, on the basis of satisfying the isolation between wireless network slices, a resource allocation mechanism based on bilateral auction is proposed. At present, many researchers have proposed that network virtualization technology is a feasible way to solve the rigid Internet architecture. In the field of existing research focuses on the cable network virtualization, mainly related to the data center network and backbone, then, the side of the wireless access network virtualization the key technology research is still in its infancy, in order to accelerate the process of wireless skill for innovation and meet the demand of the difference of the emerging business, wireless network virtualization becomes the research hotspot and focus of academia and industry. However, no one has applied the dynamic resource allocation algorithm to wireless network virtualization resource sharing field. Here, this paper analyzes and summarizes the existing virtual network resource allocation schemes at home and abroad. The wireless virtual network resource allocation model and cross-domain virtual network resource allocation model are established, and the network centrality theory in social network and complex network is introduced to analyze the topology properties of virtual network and physical network, and two efficient virtual network resource allocation methods are proposed.

Wireless Network Virtualization Resource Sharing considering Dynamic Resource Allocation Algorithm

“…If e ij � ∞, it means that the two resource nodes cannot communicate directly. If e ij � w, w ∈ R + (R + represents a positive real number), it means that resource nodes R i and R j can communicate, and the delay cost of establishing a link is w. In the static graph model, in the same time slice, only the delay cost consumed when the link is established for the first time needs to be 1 when the link is established at the end of the link; otherwise, the value is 0 [20].…”

A Microservice and Serverless Architecture for Secure IoT System

“…Consequently, effective resource allocation in the 5G and 6G era has become crucial, given the exponential growth of data across diverse industries, which necessitates intelligent solutions to enhance network performance and deliver high-quality services to users [ 22 ]. Dynamic resource allocation [ 23 ] is a vital part of this effort. For example, in 5G slicing, operators need to create different network environments for different users, provide different applications and services, and make real-time adjustments based on network load and user demand [ 24 ].…”

Fedresource

“…Wireless networks often introduce new systems with the same goals as current ones [13,14]. It is therefore possible to apply policies to newly arrived systems with no additional learning if they are network adaptable [15,16]. By using DRL-based wireless network approaches, we can deploy them more effectively than before.…”