A novel approach to virtual networks embedding for SDN management and orchestration

Guerzoni, Riccardo; Trivisonno, Riccardo; Vaishnavi, Ishan; Despotovic, Zoran; Hecker, Artur; Beker, Sergio; Soldani, David

doi:10.1109/noms.2014.6838244

Cited by 72 publications

(42 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The VNF-P is also related to the problem of virtual network embedding in software defined networks [9]. Virtual network embedding focuses on how virtual network requests, in the form of a collection of VMs and their interconnections can be deployed on physical networks.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

VNF-P: A model for efficient placement of virtualized network functions

Moens

Turck

2014

10th International Conference on Network and Service Management (CNSM) and Workshop

392

222

View full text Add to dashboard Cite

Abstract-Network Functions Virtualization (NFV) is an upcoming paradigm where network functionality is virtualized and split up into multiple building blocks that can be chained together to provide the required functionality. This approach increases network flexibility and scalability as these building blocks can be allocated and reallocated at runtime depending on demand. The success of this approach depends on the existence and performance of algorithms that determine where, and how these building blocks are instantiated. In this paper, we present and evaluate a formal model for resource allocation of virtualized network functions within NFV environments, a problem we refer to as Virtual Network Function Placement (VNF-P). We focus on a hybrid scenario where part of the services may be provided by dedicated physical hardware, and where part of the services are provided using virtualized service instances. We evaluate the VNF-P model using a small service provider scenario and two types of service chains, and evaluate its execution speed. We find that the algorithms finish in 16 seconds or less for a small service provider scenario, making it feasible to react quickly to changing demand.

show abstract

Section: Related Workmentioning

confidence: 99%

“…To formalize this, we define a collection N + containing pairs of resources (∈ Γ c ) and nodes (∈ N c ) of which the total resource demand must be minimized. We do this using the U + variable defined in Equation (9). For the datacenter example, the number of cores used can be used for this.…”

Section: B Basic Modelmentioning

confidence: 99%

VNF-P: A model for efficient placement of virtualized network functions

Moens

Turck

2014

10th International Conference on Network and Service Management (CNSM) and Workshop

392

222

View full text Add to dashboard Cite

show abstract

“…Most existing work on NSE focuses on mapping NF-graphs onto a single substrate network. The works in [35], [27], [11] present a solution to the NF-graph mapping problem, while considering different optimization goals. The authors further define a model for NF-graph transformations (i.e., NF reordering, replication, or merging) to optimize the NF placement for the provider.…”

Section: Related Workmentioning

confidence: 99%

Multi-Provider Service Chain Embedding With Nestor

Dietrich

Abujoda

Rizk³

et al. 2017

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Abstract-Network Function Virtualization (NFV) decouples network functions (NF) from the underlying middlebox hardware and promotes their deployment on virtualized network infrastructures. This essentially paves the way for the migration of NFs into clouds (i.e., NF-as-a-Service), achieving a drastic reduction of middlebox investment and operational costs for enterprises. In this context, service chains (expressing middlebox policies in the enterprise network) should be mapped onto datacenter networks, ensuring correctness, resource efficiency as well as compliance with the provider's policy. The network service embedding (NSE) problem is further exacerbated by two challenging aspects: (i) traffic scaling caused by certain NFs (e.g., caches, WAN optimizers) and (ii) NF location dependencies. Traffic scaling requires resource reservations different from the ones specified in the service chain, whereas NF location dependencies, in conjunction with the limited geographic footprint of NF providers (NFPs), raise the need for NSE across multiple NFPs.In this paper, we present a holistic solution to the multiprovider NSE problem. We decompose NSE into (i) NF-graph partitioning performed by a centralized coordinator and (ii) NF-subgraph mapping onto datacenter networks. We present linear programming formulations to derive near-optimal solutions for both problems. We address the challenging aspect of traffic scaling by introducing a new service model that supports demand transformations. We also define topology abstractions for NF-graph partitioning. Furthermore, we discuss the steps required to embed service chains across multiple NFPs, using our NSE orchestrator (Nestor). We perform an evaluation study of multi-provider NSE with emphasis on NF-graph partitioning optimizations tailored to the client and NFPs. Our evaluation results further uncover significant savings in terms of service cost and resource consumption due to the demand transformations.

show abstract

“…It is similarly related to the problem of virtual network embedding in software defined networks [9], which focuses on how virtual network requests, in the form of a collection of Virtual Machines (VMs) and their interconnections can be deployed on physical networks. Both network-aware cloud application placement and virtual network embedding approaches however make use of service topologies, similar to TBM discussed in this paper, which can be inflexible when a service can be created using multiple topologies.…”

Section: Related Workmentioning

confidence: 99%

Comparing topology and stream based strategies for modeling service function chains

Moens

Volckaert

2016

2016 IEEE NetSoft Conference and Workshops (NetSoft)

View full text Add to dashboard Cite

Abstract-Using Network Functions Virtualization (NFV), network functionality can be virtualized and deployed on generic servers. This increases network flexibility, and makes it possible to allocate network services in multiple locations throughout the network. Virtual Network Functions Placement (VNF-P) solves the problem of where network functions must be allocated within the network, and makes use of the increased flexibility of NFV networks to improve service quality or lower allocation costs. An important consideration when designing VNF-P solutions is the network service representation, as this representation can both impact the complexity of the specified services and the complexity of the management system managing and deploying them. In this paper, we define and analyze three different strategies for representing NFV-based network services: topology-based, extended topology-based and stream-based. Using three video streaming scenarios, we evaluate these approaches, comparing their expressiveness, their development complexity, and the management complexity they result in. We find that the stream-based approach results in the highest flexibility and expressiveness.

show abstract

A novel approach to virtual networks embedding for SDN management and orchestration

Cited by 72 publications

References 11 publications

VNF-P: A model for efficient placement of virtualized network functions

VNF-P: A model for efficient placement of virtualized network functions

Multi-Provider Service Chain Embedding With Nestor

Comparing topology and stream based strategies for modeling service function chains

Contact Info

Product

Resources

About