CoChat

Optimal VNF Placement via Deep Reinforcement Learning in SDN/NFV-Enabled Networks

Pei, Jianing, Hong, Peilin, Pan, Miao, Liu, Jiangqing, Zhou, Jingsong · 2020 · IEEE Journal on Selected Areas in Communications
Cited by 251

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Abstract

The emerging paradigm - Software-Defined Networking (SDN) and Network Function Virtualization (NFV) - makes it feasible and scalable to run Virtual Network Functions (VNFs) in commercial-off-the-shelf devices, which provides a variety of network services with reduced cost. Benefitting from centralized network management, lots of information about network devices, traffic and resources can be collected in SDN/NFV-enabled networks. Using powerful machine learning tools, algorithms can be designed in a customized way according to the collected information to efficiently optimize network performance. In this paper, we study the VNF placement problem in SDN/NFV-enabled networks, which is naturally formulated as a Binary Integer Programming (BIP) problem. Using deep reinforcement learning, we propose a Double Deep Q Network-based VNF Placement Algorithm (DDQN-VNFPA). Specifically, DDQN determines the optimal solution from a prohibitively large solution space and DDQN-VNFPA then places/releases VNF Instances (VNFIs) following a threshold-based policy. We evaluate DDQN-VNFPA with trace-driven simulations on a real-world network topology. Evaluation results show that DDQN-VNFPA can get improved network performance in terms of the reject number and reject ratio of Service Function Chain Requests (SFCRs), throughput, end-to-end delay, VNFI running time and load balancing compared with the algorithms in existing literatures.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/jsac.2019.2959181

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

  • Human-level control through deep reinforcement learning

    Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al. (2015) · Nature · doi:10.1038/nature14236 · Cited by 30,357 · cited 2×

    “Today, Deep Reinforcement Learning (DRL) has made significant breakthroughs and impacted various domains like control theory and strategic game playing [15], [16], which is expected to enlighten the solution to our VNF placement problem as well.”
    Background
  • Mastering the game of Go without human knowledge

    Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al. (2017) · Nature · doi:10.1038/nature24270 · Cited by 9,084 · cited 1×

    “Today, Deep Reinforcement Learning (DRL) has made significant breakthroughs and impacted various domains like control theory and strategic game playing [15], [16], which is expected to enlighten the solution to our VNF placement problem as well.”
    Background
  • A roadmap for traffic engineering in SDN-OpenFlow networks

    Akyildiz, I. F., Lee, A., Wang, P., Luo, M., & Chou, W. (2014) · Computer Networks · doi:10.1016/j.comnet.2014.06.002 · Cited by 536 · cited 1×

    “As a new networking paradigm, SDN decouples control plane and data plane, and achieves central network management with SDN controllers [4]–[6].”
    Background

Show all 3 references

Metadata

Authors
Pei, J., Hong, P., Pan, M., Liu, J., & Zhou, J.
Venue
IEEE Journal on Selected Areas in Communications
Published
2020-02
Volume
38
Issue
2
Pages
263-278
ISSN
  • 0733-8716 (ISSN-L)
  • 1558-0008
OpenAlex
W2995673860
Cited by
251
References
3
FWCI
15.01
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: Optimal VNF Placement via Deep Reinforcement Learning in SDN/NFV-Enabled Networks. https://app.cochat.ai/papers/10.1109/jsac.2019.2959181
The paper
Pei, J., Hong, P., Pan, M., Liu, J., & Zhou, J. (2020). Optimal VNF Placement via Deep Reinforcement Learning in SDN/NFV-Enabled Networks. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2019.2959181

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.