On the Optimal Approach of Survivable Virtual Network Embedding in Virtualized SDN

Li, Rongzhen; Wu, Qingbo; Tan, Yusong; Zhang, Junyang

doi:10.1587/transinf.2017edp7291

Cited by 9 publications

(6 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constraint (13) indicates that each virtual node can only be mapped to one substrate node. Constraint (14) indicates that the link bandwidth requirement in the VN request must be less than or equal to the remaining bandwidth of the substrate link. Constraint (15) indicates that the virtual link should be mapped to the acyclic path of the SN.…”

Section: A Objective Functionmentioning

confidence: 99%

“…It focuses on continuity of network services and failure resilience to ensure VN fast recovery and to minimize the effects on the network services. The methods used to deal with the failure of substrate infrastructure can be divided into two categories: recovery and protection [13], [14]. The recovery mechanism recovers VN by remapping the affected virtual nodes/links and does not need to reserve redundant resources.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

et al. 2019

View full text Add to dashboard Cite

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.

show abstract

Section: A Objective Functionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

et al. 2019

View full text Add to dashboard Cite

show abstract

“…If there is only one SDN set Q, then virtual node v is assigned to that SDN domain (lines 17 and 18). In case where Q has more than one SDN, the algorithm selects the SDN with the maximum value C i t to be assigned to the virtual node v (lines [19][20][21][22]. In lines 24 to 31, the algorithm makes the assignment of VNR to SDN domains if VN partitioning has occurred.…”

Section: Vn Assignmentmentioning

confidence: 99%

“…Although this approach is advantageous for obtaining high solution quality, it has scalability problem in large networks since a single entity may be overwhelmed with a high number of requests. For instance, the works in other studies follow a centralized approach for VNE. In comparison, a distributed approach entails multiple entities for the computation of the embedding solution.…”

Section: Related Workmentioning

confidence: 99%

Energy efficient virtual network embedding for federated software‐defined networks

Dahir

Alizadeh

Gözüpek

2019

Int J Communication

View full text Add to dashboard Cite

Summary In this paper, we focus on energy efficient virtual network embedding in federated (multidomain) software‐defined networks (SDNs). We first formulate an optimization problem as an integer linear program (ILP) that minimizes the energy consumption of the network links, while at the same time adhering to the bandwidth and CPU requirements of the virtual network requests. We then propose a polynomial‐time heuristic algorithm, which consists of three stages. In the first stage, the top SDN controller decides on whether to partition the virtual network request into smaller subrequests and give subrequests to multiple domains or give the enitre virtual network request to a single domain, while in the second stage, each SDN controller implements virtual network embedding in its own domain. Finally, in the third stage, the algorithm performs interdomain routing if partitioning decision had been made in the first stage. Our simulation results demonstrate that our proposed algorithm yields close performance to the solutions obtained by using the optimization software CPLEX that implements our ILP.

show abstract

“…A number of mechanisms have been proposed to improve the VN survivability [9]. These mechanisms can be broadly classified into two categories: backup mechanism [10] and reconfiguration mechanism [11].…”

Section: Introductionmentioning

confidence: 99%

Dynamic Virtual Network Reconfiguration Method for Hybrid Multiple Failures Based on Weighted Relative Entropy

Meng

Kang

et al. 2018

Entropy

View full text Add to dashboard Cite

Network virtualization can offer more flexibility and better manageability for next generation Internet. With the increasing deployments of virtual networks in military and commercial networks, a major challenge is to ensure virtual network survivability against hybrid multiple failures. In this paper, we study the problem of recovering virtual networks affected by hybrid multiple failures in substrate networks and provide an integer linear programming formulation to solve it. We propose a heuristic algorithm to tackle the complexity of the integer linear programming formulation, which includes a faulty virtual network reconfiguration ranking method based on weighted relative entropy, a hybrid multiple failures ranking algorithm, and a virtual node migration method based on weighted relative entropy. In the faulty virtual network reconfiguration ranking method based on weighted relative entropy and virtual node migration method based on weighted relative entropy, multiple ranking indicators are combined in a suitable way based on weighted relative entropy. In the hybrid multiple failures ranking algorithm, the virtual node and its connective virtual links are re-embedded, firstly. Evaluation results show that our heuristic method not only has the best acceptance ratio and normal operation ratio, but also achieves the highest long-term average revenue to cost ratio compared with other virtual network reconfiguration methods.

show abstract

On the Optimal Approach of Survivable Virtual Network Embedding in Virtualized SDN

Cited by 9 publications

References 23 publications

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

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

Energy efficient virtual network embedding for federated software‐defined networks

Dynamic Virtual Network Reconfiguration Method for Hybrid Multiple Failures Based on Weighted Relative Entropy

Contact Info

Product

Resources

About