IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v18y2026i6p312-d1962265.html

A Batch-Based VNF Deployment Mechanism for Privacy-Preserving Multi-Domain SFC Deployment Using Deep Reinforcement Learning

Author

Listed:
  • Arif Indra Irawan

    (Graduate School of Environmental, Life, Natural Science and Technology, Okayama University, Kita-ku, Okayama 700-8530, Japan
    School of Electrical Engineering, Telkom University, Jawa Barat 40257, Indonesia)

  • Yukinobu Fukushima

    (Faculty of Environmental, Life, Natural Science and Technology, Okayama University, Kita-ku, Okayama 700-8530, Japan)

Abstract

Future 6G networks require higher performance and wider service coverage. Multi-domain Service Function Chain (SFC) deployment enables service provisioning across multiple network domains to meet these demands. However, when collaboration occurs among different network operators, privacy-preserving mechanisms are required to protect sensitive information such as internal topology and resource availability. Existing SIRM-based mechanisms, such as the Privacy-Preserving Deployment Mechanism (PPDM), address this challenge but suffer from structural limitations: PPDM performs whole-chain feasibility evaluation with extensive virtual occupation. This paper proposes a B -Batch Sequential Deployment mechanism for privacy-preserving multi-domain SFC deployment. Instead of evaluating whole-chain feasibility at once, the proposed B -Batch mechanism partitions each incoming SFC into fixed-size VNF batches and constructs a batch-level SIRM. This design confines virtual occupation to the current batch and reduces both its magnitude and duration while remaining fully compatible with the SIRM privacy model and the hierarchical multi-domain control architecture. A Deep Q-Network (DQN) is employed to learn substrate node selection policies based solely on SIRM-based state information, without exposing domain-internal topology or resource details. Simulation results on a three-domain AARNET substrate topology demonstrate that the proposed mechanism consistently improves deployment robustness under varying traffic intensities and SFC lengths, including short (3–6 VNFs), medium (6–9 VNFs), and long (9–12 VNFs) service chains. Compared with PPDM, the proposed B -Batch mechanism achieves higher acceptance ratios under moderate-to-heavy traffic while reducing end-to-end delay and improving average substrate resource utilization. Node selection analysis further shows that smaller batch sizes preserve feasibility through compact node reuse, whereas larger batch sizes encourage broader substrate exploration. Overall, the proposed B -Batch mechanism enhances feasibility preservation and deployment robustness in privacy-preserving multi-domain SFC orchestration.

Suggested Citation

  • Arif Indra Irawan & Yukinobu Fukushima, 2026. "A Batch-Based VNF Deployment Mechanism for Privacy-Preserving Multi-Domain SFC Deployment Using Deep Reinforcement Learning," Future Internet, MDPI, vol. 18(6), pages 1-44, June.
  • Handle: RePEc:gam:jftint:v:18:y:2026:i:6:p:312-:d:1962265
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/18/6/312/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/18/6/312/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:18:y:2026:i:6:p:312-:d:1962265. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager The email address of this maintainer does not seem to be valid anymore. Please ask MDPI Indexing Manager to update the entry or send us the correct address (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.