On the computational complexity of the virtual network embedding problem

Amaldi, E.; Coniglio, Stefano; Koster, Arie M. C. A.; Tieves, Martin

doi:10.1016/j.endm.2016.03.028

Cited by 123 publications

(62 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Embedding a virtual network (service chain) requires a constrained virtual service request to be mapped on top of a physical network hosted by a single infrastructure provider, or by a federation of providers. To solve this (NP-hard [32]) graph matching problem, earlier work proposed centralized (see e.g. [17], [18], [19], [33], [34], [35], [36]) and distributed [21], [37], [38] algorithms.…”

Section: Embedding Virtual Network and Service Chainsmentioning

confidence: 99%

A Constrained Shortest Path Scheme for Virtual Network Service Management

Chemodanov

Esposito

Calyam

et al. 2019

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Virtual network services that span multiple data centers are important to support emerging data-intensive applications in fields such as bioinformatics and retail analytics. Successful virtual network service composition and maintenance requires flexible and scalable 'constrained shortest path management' both in the management plane for virtual network embedding (VNE) or network function virtualization service chaining (NFV-SC), as well as in the data plane for traffic engineering (TE). In this paper, we show analytically and empirically that leveraging constrained shortest paths within recent VNE, NFV-SC and TE algorithms can lead to network utilization gains (of up to 50%) and higher energy efficiency. The management of complex VNE, NFV-SC and TE algorithms can be, however, intractable for large scale substrate networks due to the NP-hardness of the constrained shortest path problem. To address such scalability challenges, we propose a novel, exact constrained shortest path algorithm viz., 'Neighborhoods Method' (NM). Our NM uses novel search space reduction techniques and has a theoretical quadratic speed-up making it practically faster (by an order of magnitude) than recent branch-and-bound exhaustive search solutions. Finally, we detail our NM-based SDN controller implementation in a real-world testbed to further validate practical NM benefits for virtual network services.

show abstract

Section: Embedding Virtual Network and Service Chainsmentioning

confidence: 99%

A Constrained Shortest Path Scheme for Virtual Network Service Management

Chemodanov

Esposito

Calyam

et al. 2019

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

show abstract

“…The mapping process must consider 2 major aspects: (i) the capacity of the SN and (ii) the demand of the VNs (eg, the virtual routers demand processing capacity, and the virtual links demand bandwidth). The VNE problem on optimally provisioning the resources of SN to VN requests is as such an NP‐hard problem …”

Section: Introductionmentioning

confidence: 99%

“…The VNE problem on optimally provisioning the resources of SN to VN requests is as such an NP-hard problem. 2,3 In a distributed network system, the VNE problem is defined as mapping of a set of VN requests on to a set of SNs owned and managed by multiple InPs. The objective of the aforementioned problem is to minimize the cost of VNE and the communication cost among the cooperating InPs serving these VN requests.…”

mentioning

confidence: 99%

A model for virtual network embedding using Artificial Bee Colony

Pathak

Tripathi²,

Vidyarthi

2018

Int J Communication

View full text Add to dashboard Cite

Summary In a network virtualization environment, a significant research problem is that of virtual network embedding. As the network virtualization system is distributed in nature, an effective solution on how to optimally embed a dynamically generated virtual network request on the substrate networks that are owned and managed by multiple infrastructure providers needs proper attention. The problem is computationally hard, and therefore, many approaches, implying heuristics/meta‐heuristics, have been applied for the same. A meta‐heuristic, Artificial Bee Colony algorithm is getting popular due to its robustness toward complex problem solving. A novel approach based on Artificial Bee Colony to address the dynamic virtual network embedding problem in a multiple infrastructure provider scenario is proposed in this work. Bee population is initialized by using a greedy heuristic in which the number of substrate networks together with virtual network requests constructs a bee. Generated solution, in the population, is improvised by using greedy selection that explores a local search method adopted by the bees. In greedy selection, the new candidate source is memorized by the bee if its fitness is better than the fitness of the existing source. The performance study of the proposed model is done by simulation over various metrics such as embedding cost, embedding time, and acceptance ratio. A comparative study is conducted with other nature‐inspired virtual network embedding algorithms on these metrics. The findings affirm that the proposed virtual network embedding approach performs well and produces better results.

show abstract

“…As it is known to be NP-hard [1], finding the optimal solution within reasonable time is not feasible in case of realistically sized infrastructure topologies and complex service requests. The body of research around VNE is vast: many papers present solutions either with exact optimum for limited scale scenarios, or close-to-optimal results achieved by heuristic algorithms.…”

Section: Related Workmentioning

confidence: 99%

Fast and efficient network service embedding method with adaptive offloading to the edge

Németh

Szalay

Dóka

et al. 2018

IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)

View full text Add to dashboard Cite

Abstract-Next generation networks and applications have recently drawn the attention of many researchers in both academia and industry. The plethora of service orchestration, embedding and scheduling solutions being developed indicates that efficient resource utilization in the cloud and edge/fog architecture is of crucial importance in order to exploit the great economic potential of this infrastructure. In this paper we propose a novel service orchestration approach that aims for speed and quality in terms of service provisioning: our embedding algorithm instantly deploys end-to-end delay-constrained service graphs while regularly offloads the most burdened parts of the infrastructure applying a cost-aware VNF migration strategy. In this sense we propose a hybrid orchestration approach, which unites the advantages of online heuristic and offline optimizing service orchestration methods, with the goal of obtaining a system design that provides fast service placement decisions and efficient long-term operation. By an exhaustive evaluation of our orchestration system on core, cloud and edge network topologies, we show its benefits in efficiency and the collateral cost of migrations.

show abstract

On the computational complexity of the virtual network embedding problem

Cited by 123 publications

References 8 publications

A Constrained Shortest Path Scheme for Virtual Network Service Management

A Constrained Shortest Path Scheme for Virtual Network Service Management

A model for virtual network embedding using Artificial Bee Colony

Fast and efficient network service embedding method with adaptive offloading to the edge

Contact Info

Product

Resources

About