Single and Multi-Domain Adaptive Allocation Algorithms for VNF Forwarding Graph Embedding

Network function virtualization (NFV) will simplify deployment and management of network and telecommunication services. NFV provides flexibility by virtualizing the network functions and moving them to a virtualization platform. In order to achieve its full potential, NFV is being extended to mobil...

Full description

Saved in:
Bibliographic Details
Published in:IEEE eTransactions on network and service management Vol. 16; no. 1; pp. 98 - 112
Main Authors: Quang, Pham Tran Anh, Bradai, Abbas, Singh, Kamal Deep, Picard, Gauthier, Riggio, Roberto
Format: Journal Article
Language:English
Published: New York IEEE 01.03.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Adaptive algorithms
Algorithms
approximation algorithm
Approximation algorithms
Computer architecture
Computer Science
distributed optimization
Heuristic algorithms
Heuristic methods
Integer programming
Linear programming
Migration
multi-domain orchestration
Network function virtualization
Networking and Internet Architecture
Operators (mathematics)
Optimization
Resource allocation
Resource management
Virtual networks
Virtualization
VNF-FG embedding
Wireless networks
Orchestration
Multi-domain orchestration
Virtualisation
Distributed optimization
VNF-FG embedding
Network function virtualization
VNF-FG
Approximation algorithm
VNF
ISSN:1932-4537, 1932-4537
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Network function virtualization (NFV) will simplify deployment and management of network and telecommunication services. NFV provides flexibility by virtualizing the network functions and moving them to a virtualization platform. In order to achieve its full potential, NFV is being extended to mobile or wireless networks by considering virtualization of radio functions. A typical network service setup requires the allocation of a virtual network function-forwarding graph (VNF-FG). A VNF-FG is allocated considering the resource constraints of the lower infrastructure. This topic has been well-studied in existing literature, however, the effects of variations of networks over time have not been addressed yet. In this paper, we provide a model of the adaptive and dynamic VNF allocation problem considering also VNF migration. Then we formulate the optimization problem as an integer linear programming (ILP) and provide a heuristic algorithm for allocating multiple VNF-FGs. The idea is that VNF-FGs can be reallocated dynamically to obtain the optimal solution over time. First, a centralized optimization approach is proposed to cope with the ILP-resource allocation problem. Next, a decentralized optimization approach is proposed to deal with cooperative multi-operator scenarios. We adopt AD 3 , an alternating direction method of multipliers-based algorithm, to solve this problem in a distributed way. The results confirm that the proposed algorithms are able to optimize the network utilization, while limiting the number of reallocations of VNFs which could interrupt network services.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1932-4537
1932-4537
DOI:10.1109/TNSM.2018.2876623