The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Cost-Efficient Service Function Chain Orchestration for Low-Latency Applications in NFV Networks
Abstract
With the popularization and development of cloud computing, network function virtualization and service function chain (SFC) provisioning have attracted increasing attention from researchers. Excellent and reliable network service is important for network development. Moreover, as the number of network users increases, network service construction costs become very high. Therefore, an efficient algorithm is necessary to provide an SFC with excellent performance and low resource costs. In this paper, we re-examine the problem of optimizing the deployment of an SFC to provide users with excellent and resource-saving network service. We propose a heuristic, closed-loop feedback (CLF) algorithm to find the shortest path to map an SFC. To solve the problem, we introduce and integrate a restricted Boltzmann machine and cross entropy to improve the performance of CLF. Simulation results demonstrate the excellent performance of CLF. The communication delay is reduced by approximately 20%, the accept ratio improves by approximately 15%, and the algorithm running time decreases by approximately 20%. In addition, the resource utilization ratio increases by approximately 15%, and the resource fragmentation ratio decreases by approximately 50%.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fadlullah, Z. M., Tang, F., Mao, B., Kato, N., Akashi, O., Inoue, T., & Mizutani, K. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2707140 · Cited by 810
Cited by
Sai, S., Yashvardhan, U., Chamola, V., & Sikdar, B. (2024) · IEEE Access · doi:10.1109/access.2024.3385107 · Cited by 125
Liu, Q., Yang, J., & Yan, Z. (2025) · Knowledge and Information Systems · doi:10.1007/s10115-025-02507-1 · Cited by 7
Metadata
- Authors
- Sun, G., Zhu, G., Liao, D., Yu, H., Du, X., & Guizani, M.
- Venue
- IEEE Systems Journal
- Published
- 2019-12
- Volume
- 13
- Issue
- 4
- Pages
- 3877-3888
- ISSN
- 1932-8184 (ISSN-L)
- 1937-9234
- 2373-7816
- OpenAlex
- W2904027376
- Cited by
- 220
- References
- 1
- FWCI
- 4.82
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Cost-Efficient Service Function Chain Orchestration for Low-Latency Applications in NFV Networks. https://app.cochat.ai/papers/10.1109/jsyst.2018.2879883
- The paper
- Sun, G., Zhu, G., Liao, D., Yu, H., Du, X., & Guizani, M. (2019). Cost-Efficient Service Function Chain Orchestration for Low-Latency Applications in NFV Networks. IEEE Systems Journal. https://doi.org/10.1109/jsyst.2018.2879883
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.