16 December 2020 in IEEE Transactions on Network and Service Management
In the network function virtualization (NFV) environment, network services are usually provided in the form of service function chains (SFCs), which defines the link order of virtual network functions required in service requests and are mapped to the physical network. Although NFV facilitates the flexible provision of network services, service interruptions may occur as a result of software and hardware failures. Current solutions mostly use the backup method to ensure the reliability of SFCs. However, these methods ignore the SFC construction phase that has an impact on reliability. Besides, the resource efficiency still requires improvement. To address these issues, reliability-oriented SFC construction and backup problems are investigated in this work. First, an instance-sharing and reliable construction algorithm (ISRCA) is proposed to aggregate multiple SFCs into a service function graph (SFG), and perform reliability screening for the SFG set. After mapping the SFG to the physical network, a node-ranking algorithm with centrality and reliability (NRCR) is proposed for backup node selection and backup instance deployment to improve the reliability of SFCs that have not met the requirements. Experimental results demonstrate that under the premise of ensuring reliability, the proposed backup method can reduce the consumption of bandwidth resources by about 11.7%, when combined with the proposed construction method, it can further reduce the backup resources by 13.9%.
2 December 2019 in IEEE Access
Software-defined networking (SDN) is a great innovation, which makes the network programmable so that it is easier to achieve failures recovery. Through pre-programmed recovery strategies and pre-deployed backup resource, flows can be redirected to destination quickly upon failures. However, it consumes a large amount of backup resources for fast failover. Nowadays the network scale and the magnitude of flows increase greatly, which leads to the need to deploy a large number of flow entries in face of failures. However, the Ternary Content Addressable Memory (TCAM) that stores flow entries is capacity-limited. Therefore, it is meaningful to reduce the backup resource consumption. In this paper, we propose a ring-based single-link failure recovery approach (RSFR) to improve backup resource utilization. We select a ring from the network based on node importance and link performance. Then based on the selected ring, we plan backup path and design flow tables to reuse most backup flow entries. Thus failure recovery can be achieved with less flow entries. Additionally, in order to ensure the performance of backup path, we periodically update the ring according to the predicted load. Simulation results show that the proposed approach has a great performance in terms of resource consumption and backup paths performance.
1 May 2018 in Journal of Systems and Software
31 October 2025 in IEEE Transactions on Network Science and Engineering
In edge computing power network environments, there is a growing demand to support compute-intensive Agentic AI Services, which are composed of interdependent functions represented as Directed Acyclic Graphs (DAGs). Nevertheless, the challenges posed by dynamic resource volatility and potential node failures significantly impact reliable task execution. Existing solutions (often reactive heuristics or GAN-based models) struggle to anticipate risks and overlook DAG dependencies. This paper introduces GADP, a Graph-Aware Diffusion Policy framework designed to facilitate proactive fault-tolerant DAG workload migration in large-scale edge computing systems. This paper presents GADP, a Graph-Aware Diffusion Policy framework for proactive, fault-tolerant DAG workload migration in large-scale edge systems. GADP integrates three key modules: a Transformer-GAT fault predictor for failure probability and type estimation; a DAG encoder that learns structure-preserving task embeddings via multi-round attention; and a diffusion policy generator that refines placement strategies through conditional denoising. Experiments on dynamic simulations with real workload traces show that GADP achieves 99.6% fault detection accuracy, 95.4% diagnosis F1, and over 60% fewer SLO violations, while consuming the least energy among baselines. These results demonstrate GADP's robustness and effectiveness in anticipatory migration under volatile edge conditions.
10 June 2022 in IEEE Transactions on Services Computing
5G and beyond network will support vertical industry applications, and the resource requirements of each service vary widely. The introduction of network slices provides great flexibility to the network, which can realize the differentiated customization requirements of service. However, while determining how to intelligently orchestrate the network slices is an important challenge, current solutions rarely treat multiple customized requirements of delay, bandwidth, load balancing, and slice isolation. In this paper, network slice orchestration is considered from the perspective of slice isolation and cloud-edge collaboration. First, differentiated isolation level requirements are restricted to constraints, the customized isolation is realized. Second, bandwidth is saved and network latency is reduced via the collaboration of cloud and edge data centers. In addition, exclusive orchestration optimization objectives that match various service needs are proposed to distinguish the specific requirements of different slices. Finally, two deep reinforcement learning-based algorithms are proposed. The experimental results demonstrate that the proposed algorithms can optimize the objectives while ensuring differentiated isolation levels. For typical slices, the proposed algorithms respectively reduce bandwidth consumption by about 29% and 64%, reduce slice delay by about 14% and 70%, and optimize load balancing by about 17% and 23%.
29 September 2021 in IEEE Transactions on Sustainable Computing
Energy consumption is becoming a key issue in the research of future network. In practice, network traffic has a periodic time distribution that occurs most often at a low level. This feature provides the possibility of achieving network energy savings through topology switching. By considering the deficiencies in existing studies, such as the low adaptability between network working topology and traffic load, the abnormal topology switching caused by abnormal and unbalanced traffic, and the low reliability of energy-saving topology, this paper proposes an energy-efficient routing method for software-defined networks based on topology switching and reliability. The method involves two parts: a topology-switching method and a failure recovery method. The former adapts the network working topology to the network traffic demands through dynamic topology switching to decrease the network energy consumption. The latter adopts an active strategy for fast fault recovery to ensure network reliability in the energy-efficient topology. Two network typologies and their traffic data are used to experimentally verify the method. The results show that, compared with the static topology switching method TLS, the energy saving of the proposed method can be improved at most 2.07 times and 4.63 times in two typical typologies, respectively, while ensuring network reliability.