Survivable Virtual Network Link Shared Protection Method Based on Maximum Spanning Tree

Abstract

Network virtualization allows multiple independent and mutual non-interfering virtual networks (VNs) to run simultaneously on a shared substrate network (SN) providing a promising method for overcoming the network ossification. Substrate infrastructure failures occur frequently, most of which are substrate link failures. This has created a research hotspot in the field of survivable VN. In this paper, we add to the research by analyzing the substrate link failures and proposing a survivable VN link shared protection method based on the maximum spanning tree. First, an integer linear programming formulation for the survivable VN link shared protection is established to minimize the backup link bandwidth ratio. Second, an efficient VN mapping algorithm based on optimal matching is designed to make full use of the limited substrate resources. This mapping algorithm that fully considers the topological connections between nodes in the node mapping phase improves the acceptance ratio and the long-term average revenue to cost ratio. Finally, a maximum spanning tree link protection algorithm is proposed, and a reasonable sharing mechanism of backup link resources among different VNs is designed to ensure the VN survivability and reduce the SN resource consumption. The experimental results show that our method not only guarantees the VN survivability but also reduces SN resource consumption.INDEX TERMS Survivable virtual network, substrate link failure, link shared protection, optimal matching, maximum spanning tree, sharing mechanism.

A Service Function Chain Deployment Method Based on Network Flow Theory for Load Balance in Operator Networks

“…The number of VNFs contained in an SFC request obeys the uniform distribution of [2], [4], and the types of VNFs are different. The computing resource demands of VNFs obey the uniform distribution of [7], [10], and the bandwidth demands of SFCs obey the uniform distribution of [5], [8]. The maximum allowable transmission delay of SFC obeys the uniform distribution of [6], [8].…”

“…In SFC deployment, the bandwidth resources, forwarding resources and computing resources of the substrate network should be occupied simultaneously. The SFC deployment is also an NP-hard problem like the virtual network mapping [9], [10]. Therefore, deciding how to design an efficient and reasonable SFC deployment strategy is particularly important.…”

Optimization of Regional City Economic Gravity Network Based on Optimal Tree Theory

“…Hence, the MST has been frequently adopted for network optimization to solve engineering problems [17][18][19][20]. On the contrary, the maximum spanning tree aims to find a spanning tree with maximum total cost, which enhances the benefit and impact of the network [21,22].…”

Distributed algorithm for a finite time horizon resource allocation over a directed network

“…However, in many applications such as wireless sensor networks, the transmission of signals between sensors is unbalanced due to different power consumption and heterogeneous nature of the sensor nodes [15]. Thereby, a number of researchers shift their attentions to directed unbalanced graphs, such as spanning tree [16], directed network with transmission losses [17]. In this paper, our interest lies in modelling the information exchange over a finite time horizon for a directed multi‐agent network, in which the agents are connected via a strongly connected network at each time unit within the time horizon.…”