Special Issue "Virtual Network Embedding"

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Combinatorial Optimization, Graph, and Network Algorithms".

Deadline for manuscript submissions: closed (16 August 2020).

Special Issue Editor

Prof. Dr. Andreas Fischer
E-Mail
Guest Editor
Deggendorf Institute of Technology, Deggendorf, Germany
Interests: Network Virtualisation (SDN & NFV); Network Resilience; Experimental Algorithmics

Special Issue Information

Dear Colleagues,

With the rise of software-defined networking and network function virtualization, sophisticated optimization of complex communication networks is more important than ever. The field of virtual network embedding has emerged, discussing all aspects of the optimization of resource assignment in complex networks. Practical applications include federated cloud environments or mobile (5G) telecommunication networks.
The optimization itself often hits a performance bound, as the underlying resource assignment problem is found to be NP-complete. This requires elaborate heuristic algorithms. Solution approaches encompass all types of optimization algorithms, online and offline, with resource models ranging from simple numbers to elaborate node and link categories. Recently, advances in artificial intelligence and machine learning have also provided promising results this field. Further, the evaluation and in-depth comparison of related solution approaches has started to gain more attention.
In this Special Issue, we want to discuss recent research advances in this field. We invite novel contributions showing interesting and relevant results related to the keywords listed below.

Prof. Dr. Andreas Fischer
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Planning and optimization for complex networks
  • Service function chain embedding
  • Network embedding for cloud providers
  • Dynamic service provisioning in operator networks
  • Resource planning for software-defined networks
  • Network resource allocation
  • Nonlinear optimization algorithms
  • Machine learning for network optimization
  • Mixed integer linear programming for embedding
  • Embedding heuristics and metaheuristics
  • Algorithmic experimentation and evaluation
  • Random problem generation for embedding algorithms
  • Simulation environments

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

Article
Dynamic Virtual Network Slicing and Orchestration for Selective MEC Services over Wide-Area SDN
Algorithms 2020, 13(10), 245; https://doi.org/10.3390/a13100245 - 27 Sep 2020
Viewed by 1004
Abstract
Multi-access edge computing (MEC) has become an essential technology for collecting, analyzing, and processing data generated by widely distributed user equipment (UE), wireless end-hosts, Internet of things (IoT) sensors, etc., providing real-time and high-quality networking services with ultralow end-to-end latency guaranteed between various [...] Read more.
Multi-access edge computing (MEC) has become an essential technology for collecting, analyzing, and processing data generated by widely distributed user equipment (UE), wireless end-hosts, Internet of things (IoT) sensors, etc., providing real-time and high-quality networking services with ultralow end-to-end latency guaranteed between various user devices and edge cloud computing nodes. However, the cloud resources at the MEC on-site (access point) and edge site are restricted and insufficient mainly because of the operation and management constraints (e.g., limited space and capacity), particularly in the case of on-demand and dynamic service resource deployment. In this regard, we propose a selective MEC resource allocation scheme adopting a multitier architecture over a wide-area software-defined network (SDN) on the basis of our recent research work on virtual network slicing and resource orchestration. The proposed scheme provides an optimized MEC selection model considering end-to-end latency and efficient service resource utilization on the basis of the hierarchical MEC service architecture. Full article
(This article belongs to the Special Issue Virtual Network Embedding)
Show Figures

Figure 1

Article
Policy-Based Composition and Embedding of Extended Virtual Networks and SFCs for IIoT
Algorithms 2020, 13(9), 240; https://doi.org/10.3390/a13090240 - 22 Sep 2020
Cited by 1 | Viewed by 867
Abstract
The autonomic composition of Virtual Networks (VNs) and Service Function Chains (SFCs) based on application requirements is significant for complex environments. In this paper, we use graph transformation in order to compose an Extended Virtual Network (EVN) that is based on different requirements, [...] Read more.
The autonomic composition of Virtual Networks (VNs) and Service Function Chains (SFCs) based on application requirements is significant for complex environments. In this paper, we use graph transformation in order to compose an Extended Virtual Network (EVN) that is based on different requirements, such as locations, low latency, redundancy, and security functions. The EVN can represent physical environment devices and virtual application and network functions. We build a generic Virtual Network Embedding (VNE) framework for transforming an Application Request (AR) to an EVN. Subsequently, we define a set of transformations that reflect preliminary topological, performance, reliability, and security policies. These transformations update the entities and demands of the VN and add SFCs that include the required Virtual Network Functions (VNFs). Additionally, we propose a greedy proactive heuristic for path-independent embedding of the composed SFCs. This heuristic is appropriate for real complex environments, such as industrial networks. Furthermore, we present an Industrail Internet of Things (IIoT) use case that was inspired by Industry 4.0 concepts, in which EVNs for remote asset management are deployed over three levels; manufacturing halls and edge and cloud computing. We also implement the developed methods in Alevin and show exemplary mapping results from our use case. Finally, we evaluate the chain embedding heuristic while using a random topology that is typical for such a use case, and show that it can improve the admission ratio and resource utilization with minimal overhead. Full article
(This article belongs to the Special Issue Virtual Network Embedding)
Show Figures

Figure 1

Back to TopTop