| ID | 70861 |
| FullText URL | |
| Author |
Irawan, Arif Indra
Graduate School of Environmental, Life, Natural Science and Technology, Okayama University
Fukushima, Yukinobu
Faculty of Environmental, Life, Natural Science and Technology, Okayama University
|
| 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 ℬ-Batch Sequential Deployment mechanism for privacy-preserving multi-domain SFC deployment. Instead of evaluating whole-chain feasibility at once, the proposed ℬ-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 ℬ-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 ℬ-Batch mechanism enhances feasibility preservation and deployment robustness in privacy-preserving multi-domain SFC orchestration.
|
| Keywords | Service Function Chain (SFC)
Virtual Network Embedding (VNE)
privacy preservation
SIRM
Virtual Network Function (VNF)
Deep Q-network (DQN)
|
| Published Date | 2026-06-08
|
| Publication Title |
Future Internet
|
| Volume | volume18
|
| Issue | issue6
|
| Publisher | MDPI AG
|
| Start Page | 312
|
| ISSN | 1999-5903
|
| Content Type |
Journal Article
|
| language |
English
|
| OAI-PMH Set |
岡山大学
|
| Copyright Holders | © 2026 by the authors.
|
| File Version | publisher
|
| DOI | |
| Related Url | isVersionOf https://doi.org/10.3390/fi18060312
|
| License | https://creativecommons.org/licenses/by/4.0/
|
| 助成情報 |
23K11065:
超リアルタイムサービスを指向したネットワーク制御における特徴量エンジニアリン グ
( 独立行政法人日本学術振興会 / Japan Society for the Promotion of Science )
|