IEEE INFOCOM 2020 - IEEE Conference on Computer Communications 2020
DOI: 10.1109/infocom41043.2020.9155345
|View full text |Cite
|
Sign up to set email alerts
|

Latency-aware VNF Chain Deployment with Efficient Resource Reuse at Network Edge

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
18
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 111 publications
(24 citation statements)
references
References 31 publications
0
18
0
Order By: Relevance
“…Orchestration in the edge of 5G has motivated solutions [11] that benefit from edge servers to asses the mapping and migration of VNF resources upon users' mobility. Additionally, edge computing has popped up the quest of deploying NSs with very strict latency requirements, and recent research as [30], [31], [32], [33], and [34] study solutions about how to allocate VNFs to meet low latency requirements. [30] uses a genetic algorithm to obtain a fixed allocation that minimizes/maximizes latency/availability, [34] provides a stopping theory solution that migrates the allocated VNFs as time passes, such that latency restrictions are not violated.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Orchestration in the edge of 5G has motivated solutions [11] that benefit from edge servers to asses the mapping and migration of VNF resources upon users' mobility. Additionally, edge computing has popped up the quest of deploying NSs with very strict latency requirements, and recent research as [30], [31], [32], [33], and [34] study solutions about how to allocate VNFs to meet low latency requirements. [30] uses a genetic algorithm to obtain a fixed allocation that minimizes/maximizes latency/availability, [34] provides a stopping theory solution that migrates the allocated VNFs as time passes, such that latency restrictions are not violated.…”
Section: Related Workmentioning
confidence: 99%
“…[30] uses a genetic algorithm to obtain a fixed allocation that minimizes/maximizes latency/availability, [34] provides a stopping theory solution that migrates the allocated VNFs as time passes, such that latency restrictions are not violated. [31] formulates an optimization problem to allocate VNFs demanded by endusers attached to antennas, so as to maximize/minimize resources re/usage, by imposing latency constraints. [32] proposes a deep learning agent that assigns VNFs to servers maximizing the requests' throughput, while they meet latency constraints.…”
Section: Related Workmentioning
confidence: 99%
“…Aburukba et al and Lakhan et al [17] suggested mobility-aware workload assignment solutions for the distributed network. The processing delay, communication delay and prorogation delay are also considered during problem formulation and, based on these delays, the studies proposed solutions.…”
Section: Related Workmentioning
confidence: 99%
“…Equation (17) shows the commutative probability of the objective function during the initial assignment of workloads.…”
mentioning
confidence: 99%
“…While a number of current literatures solve the different requirement-driven SFC resource allocation problem [17][18][19][20][21] in the generic NFV environment, few works have taken the security-driven SFC embedding in the cloud datacenter networks into account, which is actually a fairly recent issue. There are some pioneering studies with regard to the SSC-DMP [6,[13][14].…”
Section: Introductionmentioning
confidence: 99%