Online algorithm for migration aware Virtualized Network Function placing and routing in dynamic 5G networks

Xie, Yanghao; Wang, Sheng; Wang, Binbin; Xu, Shizhong; Wang, Xiong; Ren, Jing

doi:10.1016/j.comnet.2021.108115

Cited by 11 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bu et al [14] proposed a mechanism for dynamically deploying customized network functions through NFV, contributing to the efficient adaptation of network services. In Xie et al [15], the authors examined the effects of flow rate fluctuations in service requests, leading to potential service migrations and fluctuations in network queues (buffers). Their research addresses the cost-minimizing problem of VNF placement and routing within this dynamic environment while considering service migration and queue backlog stability.…”

Section: Traffic-aware Vnf Migrationmentioning

confidence: 99%

“…In Figure 1, we can identify the following steps: 1 Input SFCs; 2 Copy; 3 Calculate reward and save information; 4 Extract historical network traffic data; 5 Predict network traffic; 6 Input requirement of SFCs and update data for the environment; 7 Input environmental data or calculate reward; 8 Calculate the migration of SFC requests; 9 Input the deployment results of SFC migration; 10 11 Copy model and parameters; 12 Input environmental data and historical network traffic data; 13 Predict network traffic; 14 Input the requirements of SFC; 15 Input the environmental data; 16 Calculate the migration of SFC requests and input the results into the environment.…”

Section: The Architecture Of the Dt Network In Nfv Environmentmentioning

confidence: 99%

See 1 more Smart Citation

VNF Migration in Digital Twin Network for NFV Environment

Hu,

Min,

et al. 2023

Electronics

View full text Add to dashboard Cite

Network Function Virtualization (NFV) allows for the dynamic provisioning of Virtual Network Functions (VNFs), adapting services to the complex and dynamic network environment to enhance network performance. However, VNF migration and energy consumption pose significant challenges due to the dynamic nature of the physical network. In order to maximize the acceptance rate of Service Function Chain Requests (SFCR), and reduce VNF migration and energy consumption as much as possible, we summarize several related factors such as the node hosting state, link hosting state, energy consumption, migrated nodes, and whether the mapping is successful. We define the Markov decision process by considering the factors mentioned above. Next, we design the VNF migration algorithm utilizing actor–critic models, graph convolution networks, and LSTM networks. In order to reduce the risk of trial and error during training and prediction in deep reinforcement learning scenarios, we designed a network architecture based on a digital twin (DT). In simulation experiments, compared with the FF algorithm that greedily selects the first available node, our AC_GCN algorithm significantly improves the acceptance rate of SFC requests by 2.9 times more than the FF algorithm in small topology experiments, and 27 times more than the FF algorithm in large topology experiments. Compared with the deep reinforcement learning (DRL) algorithm, which does not consider all the above factors together, for the small topology experiment, our AC_GCN algorithm outperforms the DRL algorithm in terms of request acceptance rate by 13%, underperforms compared to the DRL algorithm in terms of energy consumption by 3.8%, and underperforms compared to the DRL algorithm in terms of the number of migrated nodes for 22%; for the large topology experiment, our AC_GCN algorithm outperforms the DRL algorithm in terms of the request acceptance rate by 7.7%, outperforms the DRL algorithm in terms of energy consumption by 0.4%, and outperforms the DRL algorithm in terms of the number of migrated nodes by 1.6%.

show abstract

Section: Traffic-aware Vnf Migrationmentioning

confidence: 99%

Section: The Architecture Of the Dt Network In Nfv Environmentmentioning

confidence: 99%

VNF Migration in Digital Twin Network for NFV Environment

Hu,

Min,

et al. 2023

Electronics

View full text Add to dashboard Cite

show abstract

“…The VNFs placement for cost efficient was also formulated and addressed with a matrix-based optimization and a multi-stage graph method in [25]. Xie et al studied the costminimization problem of VNF placing and routing in dynamic 5G environment while considering service migration and queue backlog stability [26]. The online algorithm, named MACRO, which was based on the Lyapunov optimization paradigm, was proposed to solve the problem.…”

Section: Network Function Virtualizationmentioning

confidence: 99%

Joint wireless resource allocation and service function chaining scheduling for Tactile Internet

Guo

Mukherjee²,

Lloret³

et al. 2022

Computer Networks

View full text Add to dashboard Cite

“…Improving the quality of service in modern mobile communication systems requires a coordinated interaction of cellular radio access technologies with a family of WiFi local access technologies that use an unlicensed frequency spectrum. This circumstance causes frequent failures and outages in active processes of information interaction based on such a multi-technological basis [ 6 – 8 ].…”

Section: Introductionmentioning

confidence: 99%

Modeling a session of subject-system interaction in a wireless communication infrastructure with a mixed resource

2022

View full text Add to dashboard Cite

The article examines the subject-system interaction session, where the system is understood as a base station, and the subject is understood as a mobile communication device. The peculiarity of the study is taking into account the phenomenon relevant to modern communication infrastructures, which is that the base station supports the division of information traffic into a subspace of guaranteed personalized traffic and a subspace of general-purpose traffic. The study considers a highly critical empirical emergency when the general-purpose traffic subspace may cease to be available at any time. The presented mathematical apparatus describes the impact of such an emergency on the active communication sessions supported by the system in receiving new incoming requests of increasing intensity. To characterize this emergency situation, expressions adapted for practical application are presented to calculate such qualitative parameters as the probability of stability, the probability of failure, and unavailability.

show abstract

Online algorithm for migration aware Virtualized Network Function placing and routing in dynamic 5G networks

Cited by 11 publications

References 25 publications

VNF Migration in Digital Twin Network for NFV Environment

VNF Migration in Digital Twin Network for NFV Environment

Joint wireless resource allocation and service function chaining scheduling for Tactile Internet

Modeling a session of subject-system interaction in a wireless communication infrastructure with a mixed resource

Contact Info

Product

Resources

About