Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Networking and Internet Architecture

arXiv:2201.00555 (cs)
[Submitted on 3 Jan 2022]

Title:Deterministic Service Function Chaining over Beyond 5G Edge Fabric

Authors:H.Yu, T.Taleb, J.Zhang
View PDF
Abstract:Along with the increasing demand for latencysensitive services and applications, Deterministic Network (DetNet) concept has been recently proposed to investigate deterministic latency assurance for services featured with bounded latency requirements in 5G edge networks. The Network Function Virtualization (NFV) technology enables Internet Service Providers (ISPs) to flexibly place Virtual Network Functions (VNFs) achieving performance and cost benefits. Then, Service Function Chains (SFC) are formed by steering traffic through a series of VNF instances in a predefined order. Moreover, the required network resources and placement of VNF instances along SFC should be optimized to meet the deterministic latency requirements. Therefore, it is significant for ISPs to determine an optimal SFC deployment strategy to ensure network performance while improving the network revenue. In this paper, we jointly investigate the resource allocation and SFC placement in 5G edge networks for deterministic latency assurance. We formulate this problem as a mathematic programming model with the objective of maximizing the overall network profit for ISP. Furthermore, a novel Deterministic SFC deployment (Det-SFCD) algorithm is proposed to efficiently embed SFC requests with deterministic latency assurance. The performance evaluation results show that the proposed algorithm can provide better performance in terms of SFC request acceptance rate, network cost reduction, and network resource efficiency compared with benchmark strategy.
Subjects: Networking and Internet Architecture (cs.NI)
Cite as: arXiv:2201.00555 [cs.NI]
  (or arXiv:2201.00555v1 [cs.NI] for this version)
  https://doi.org/10.48550/arXiv.2201.00555

Submission history

From: Tarik Taleb Dr. [view email]
[v1] Mon, 3 Jan 2022 10:04:15 UTC (588 KB)
Full-text links:

Access Paper:

  • View PDF
  • Other Formats
license icon view license
Current browse context:
cs.NI
< prev   |   next >
new | recent | 2022-01
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
H. Yu
J. Zhang
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)