Network function placement on virtualized cellular cores

Dietrich, David; Papagianni, Chrysa; Papadimitriou, Panagiotis; Baras, John S.

doi:10.1109/comsnets.2017.7945385

Cited by 48 publications

(42 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, [22], [23], and [28] model the assignment of VNFs to servers as a generalized assignment problem, a resource-constrained shortest path problem and a MILP problem, respectively. This implies that either a server has enough spare CPU capacity to offer a VNF, or it does not.…”

Section: Noveltymentioning

confidence: 99%

“…Our queuing model, instead, is the first to account for the flexible allocation of CPU to the VNFs running on a host, e.g., the fact that VNFs will work faster if placed at a scarcely-utilized server. Furthermore, [22] and [28] have as objective the minimization of costs and server utilization, respectively. Our objective, instead, is to minimize the delay incurred by requests of different classes, which changes the solution strategy that can be adopted.…”

Section: Noveltymentioning

confidence: 99%

See 1 more Smart Citation

VNF Placement and Resource Allocation for the Support of Vertical Services in 5G Networks

Agarwal

Malandrino

Chiasserini

et al. 2019

IEEE/ACM Trans. Networking

103

View full text Add to dashboard Cite

One of the main goals of 5G networks is to support the technological and business needs of various industries (the so-called verticals), which wish to offer to their customers a wide range of services characterized by diverse performance requirements. In this context, a critical challenge lies in mapping in an automated manner the requirements of verticals into decisions concerning the network infrastructure, including VNF placement, resource assignment, and traffic routing. In this paper, we seek to make such decisions jointly, accounting for their mutual interaction, and efficiently. To this end, we formulate a queuingbased model and use it at the network orchestrator to optimally match the vertical's requirements to the available system resources. We then propose a fast and efficient solution strategy, called MaxZ, which allows us to reduce the solution complexity. Our performance evaluation, carried out accounting for multiple scenarios representative of real-world services, shows that MaxZ performs substantially better than state-ofthe-art alternatives and consistently close to the optimum. INTRODUCTION5G networks are envisioned to provide the computational, memory, and storage resources needed to run multiple third parties (referred to as vertical industries or verticals) with diverse communication and computation needs. Verticals provide network operators with the specification of the services they want to provide, e.g., the virtual network functions (VNFs) they want to use to process their data and the associated quality of service.Mobile network operators are in charge of mapping the requirements of the verticals into infrastructure management decisions. This task is part of the network orchestration, and includes making decisions concerning (i) the placement of the VNFs needed by the verticals across the infrastructure; (ii) the assignment of CPU, memory and storage resources to the VNFs; (iii) the routing of data across network nodes.These decisions interact with each other in ways that are complex and often counterintuitive. In this paper, we focus on the allocation of computational and network resources, and make such decisions jointly, accounting for (i) the requirements of each VNF and vertical; (ii) the capabilities of the network operator's infrastructure; (iii) the capacity • S. Agarwal is with IIT Guwahati, India. F. Malandrino and C.-F. Chiasserini are with Politecnico di Torino, Italy and CNR-IEIIT, Italy. S. De is with IIT Delhi, India. • A preliminary version [1] of this work was presented at the IEEE INFOCOM 2018 conference.

show abstract

Section: Noveltymentioning

confidence: 99%

Section: Noveltymentioning

confidence: 99%

VNF Placement and Resource Allocation for the Support of Vertical Services in 5G Networks

Agarwal

Malandrino

Chiasserini

et al. 2019

IEEE/ACM Trans. Networking

103

View full text Add to dashboard Cite

show abstract

“…The proposed model aims to provide an efficient network slicing solution by analyzing the past network slicing information. D. Dietrich et al [1] proposed linear programming formulation for the placement of VNFs in the LTE core network. In the proposed algorithm, they provided a balance between optimality and time complexity.…”

Section: Arxiv:180204655v4 [Csni] 19 Apr 2019mentioning

confidence: 99%

“…In the following MILP formulation, we use the network model and variables from [1]. In that model, each request is associated with a computing demand (g i ) and bandwidth requirement (g i j ).…”

Section: Milp Formulationmentioning

confidence: 99%

“…In this paper, we address the question of optimal slice allocation in 5G core networks (virtual Evolved Core (vEPC)). We do this by adopting and extending VNF placement in the LTE core network presented by D. Dietrich et al [1]. Our contributions are to (1) guarantee end-to-end delay, (2) provide intra-slice isolation for slice allocation and (3) find a minimum delay path between the slice components.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimal Slice Allocation in 5G Core Networks

Sattar

Matrawy

2019

IEEE Netw. Lett.

View full text Add to dashboard Cite

5G network slicing is essential to providing flexible, scalable and on-demand solutions for the vast array of applications in 5G networks. Two key challenges of 5G network slicing are function isolation (intra-slice) and guaranteeing end-to-end delay for a slice. In this paper, we address the question of optimal allocation of a slice in 5G core networks by tackling these two challenges. We adopt and extend the work by D. Dietrich et al.[1] to create a model that satisfies constraints on end-to-end delay as well as isolation between components of a slice for reliability.

show abstract

ILP‐based heuristics for a virtual network function placement and routing problem

2021

View full text Add to dashboard Cite

Thanks to the increased availability of computing capabilities in data centers, the recently proposed virtual network function paradigm can be used to keep up with the increasing demand for network services as internet and its applications grow. The problem arises then of managing the virtual network functions, that is, to decide where to instantiate the functions and how to route the demands to reach them. While it arises in an application field, the Virtual Network Function placement and routing problem combines location and routing aspects in an interesting, challenging problem. In this paper, we propose several ILP‐based heuristics and compare them on a dataset that includes instances with different sizes, network topologies, and service capacity. The heuristics prove effective in tackling even large size instances, with up to 50 nodes and more than 80 arcs.

show abstract

Network function placement on virtualized cellular cores

Cited by 48 publications

References 23 publications

VNF Placement and Resource Allocation for the Support of Vertical Services in 5G Networks

VNF Placement and Resource Allocation for the Support of Vertical Services in 5G Networks

Optimal Slice Allocation in 5G Core Networks

ILP‐based heuristics for a virtual network function placement and routing problem

Contact Info

Product

Resources

About