Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Embedding Dependence-Aware Service Function Chains

Not Accessible

Your library or personal account may give you access

Abstract

Network function virtualization (NFV) provides an effective way to decouple network functions from the proprietary hardware, allowing the network providers to implement network functions as virtual machines running on standard servers. In the NFV environment, an NFV service request is provisioned in the form of a service function chain (SFC). The SFC defines the exact sequence of actions or virtual network functions (VNFs) that the data stream from the service request is subjected to. These actions or VNFs need to be mapped onto specific physical networks to provide network services for end users. In this paper, we investigate the problem of dependence-aware service function chain (D_SFC) design and mapping. We study how to efficiently map users’ service requests over the physical network while taking into consideration the computing resource demand, function dependence of the VNFs, and the bandwidth demand for the service request. We propose an efficient algorithm, namely, Dependence-Aware SFC Embedding With Group Mapping (D_SFC_GM), which integrates the proposed techniques of dependence sorting, independent grouping, adaptive mapping, and tetragon remapping to jointly design and map users’ service requests. The proposed D_SFC_GM algorithm takes advantage of VNF’s dependence relationships and the available resources in the physical network to efficiently design the chain and reserve the computing/bandwidth in the physical network. The extensive performance analysis in both IP and physical networks shows that the proposed D_SFC_GM significantly outperforms the traditional approach based on topological sorting and sequential embedding.

© 2018 Optical Society of America

Full Article  |  PDF Article
More Like This
Delay-aware and resource-efficient service function chain mapping in inter-datacenter elastic optical networks

Min Zhu, Jiahua Gu, Tianyu Shen, Jiao Zhang, and Pingping Gu
J. Opt. Commun. Netw. 14(10) 757-770 (2022)

Energy-Efficient Service Function Chain Provisioning

Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, and Brigitte Jaumard
J. Opt. Commun. Netw. 10(3) 114-124 (2018)

Reprovisioning for latency-aware dynamic service chaining in metro networks

Leila Askari, Francesco Musumeci, and Massimo Tornatore
J. Opt. Commun. Netw. 12(11) 355-366 (2020)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (10)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (11)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (6)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved