NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium 2018
DOI: 10.1109/noms.2018.8406159
|View full text |Cite
|
Sign up to set email alerts
|

An approach to deploy service function chains in satellite networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 19 publications
(14 citation statements)
references
References 12 publications
0
14
0
Order By: Relevance
“…For software defined satellite networks, the VNF placement problem has been investigated in [9], [17], [18]. The authors in [9] formulated the VNF placement problem as an integer nonlinear programming problem in space-air ground integrated networks and proposed a greedy algorithm to address it.…”
Section: B Vnf Placement In Edge Computingmentioning
confidence: 99%
See 2 more Smart Citations
“…For software defined satellite networks, the VNF placement problem has been investigated in [9], [17], [18]. The authors in [9] formulated the VNF placement problem as an integer nonlinear programming problem in space-air ground integrated networks and proposed a greedy algorithm to address it.…”
Section: B Vnf Placement In Edge Computingmentioning
confidence: 99%
“…The authors in [17] discussed the problem of VNF placement to minimize the cost in software defined satellite networks and proposed a time-slot decoupled heuristic algorithm to solve this problem. In [18], an approach of deploying VNFs in satellite networks was presented to minimize the end-to-end service delay.…”
Section: B Vnf Placement In Edge Computingmentioning
confidence: 99%
See 1 more Smart Citation
“…Cai et al [30] aimed to achieve a flexible service orchestration for satellite networks with minimal end-to-end service delays. Based on the general NFV-enabled architecture, they built a time-varying satellite communication network model and novel forms of SFC requests.…”
Section: B Sfc Deployment For Optimizing the End-to-end Delaymentioning
confidence: 99%
“…Similar with Ref. [17], we assume that each node has 2000 computing resources, each link has 2000 Mbps bandwidth resources, and the end-to-end delay of each link follows a uniform distribution, U (30,130). In the experiment, we generate 500 SFC requests per group.…”
Section: A Experiments Environment and Settingsmentioning
confidence: 99%