Citation: Tian, J.; Zeng, X.; Zhu, X.
DDS: A Delay-Based Differentiated
Service Virtual Network Embedding
Algorithm. Appl. Sci. 2022, 12, 9897.
https://doi.org/10.3390/app12199897
Academic Editor: Alexandros-
Apostolos Boulogeorgos
Received: 25 August 2022
Accepted: 26 September 2022
Published: 1 October 2022
Publisher’s Note: MDPI stays neutral
with regard to jurisdictional claims in
published maps and institutional affil-
iations.
Copyright: © 2022 by the authors.
Licensee MDPI, Basel, Switzerland.
This article is an open access article
distributed under the terms and
conditions of the Creative Commons
Attribution (CC BY) license (https://
creativecommons.org/licenses/by/
4.0/).
Article
DDS: A Delay-Based Differentiated Service Virtual Network
Embedding Algorithm
Jiamin Tian
1,2
, Xuewen Zeng
1,2
and Xiaodong Zhu
1,
*
1
National Network New Media Engineering Research Center, Institute of Acoustics,
Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, China
2
School of Electronic, Electrical and Communication Engineering, University of Chinese Academy of Sciences,
No. 19(A), Yuquan Road, Shijingshan District, Beijing 100049, China
* Correspondence: zhuxd@dsp.ac.cn
Abstract:
Network virtualization (NV) is considered a promising technology that may solve the
problem of Internet rigidity. The resource competition of multiple virtual networks for shared
substrate network resources is a challenging problem in NV called virtual network embedding (VNE).
Existing approaches do not consider the differences between multi-tenant requests and adopt a
single embedding method, resulting in poor performance. This paper proposes a virtual network
embedding algorithm that distinguishes the network types requested by tenants. This method divides
virtual network requests into ordinary requests and delay-sensitive requests according to the delay
constraints, provides personalized mapping strategies for different networks, and flexibly responds
to the resource requirements and quality of service (QoS) requirements of the virtual network. The
simulation results show that, compared with other algorithms, the proposed algorithm improves
the request acceptance ratio by about 2% to 15% and the substrate network resources are more
effectively utilized.
Keywords:
network virtualization; virtual network embedding; NP-hard; heuristic algorithm; integer
linear programming
1. Introduction
With the rise of various new network services and applications, the demands of users
for the network show a diversified trend. However, deploying new businesses under
the traditional network architecture requires not only redeployment of hardware but also
consensus among device providers, which is difficult to cope given the diverse, customized,
and differentiated applications. The proposal of network virtualization is to overcome the
impasse of the Internet [
1
]. As one of the important technologies for promoting current
network innovation [
2
], network virtualization has been actively applied in many research
testbeds and projects [
3
], such as CABO [
4
], 4WARD [
5
], and G-Lab [
6
]. Through network
virtualization, multiple isolated networks can be virtualized in the shared underlying
network infrastructure. Each virtual network can customize the network structure or
run different network protocols according to business requirements. Different users can
use their network resources independently without interfering with each other, thereby
improving the utilization of network resources, satisfying the diverse demands of users,
and realizing an elastic network.
In network virtualization, the Internet service providers (ISPs) in traditional networks
are divided into infrastructure providers (InPs) and service providers (SPs). This decoupling
method that separates resources and services is more flexible. InPs are responsible for
providing underlying infrastructure and managing underlying network resources. SPs
rent physical resources from InPs, build and operate virtual networks, and offer services
through virtual networks. Embedding the requests of SPs onto underlying infrastructure
depends on efficient embedding algorithms.
Appl. Sci. 2022, 12, 9897. https://doi.org/10.3390/app12199897 https://www.mdpi.com/journal/applsci
