BROWSE
Detail
Journal Article
Network function parallelism configuration with segment routing over IPv6 based on deep reinforcement learning
- Authors
- Seokwon Jang, Namseok Ko, Yeunwoong Kyung, Haneul Ko, Jaewook Lee, Sangheon Pack
- Issue Date
- 2025-04
- Citation
- ETRI Journal, v.47, no.2, pp.278-289
- ISSN
- 1225-6463
- Publisher
- 한국전자통신연구원
- Language
- Korean
- Type
- Journal Article
- Abstract
- Network function parallelism (NFP) has gained attention for processing packets in parallel through service functions arranged in the required service function chain. While parallel processing efficiently reduces the service function chaining (SFC) completion time, it incurs a higher network overhead (e.g., network congestion) to replicate various packets for processing. To reduce the SFC completion time while maintaining a low network overhead, we propose a deep-reinforcement-learning-based NFP algorithm (DeepNFP) that provides an SFC processing policy to determine the sequential or parallel processing of every service function. In DeepNFP, deep reinforcement learning captures the network dynamics and service function conditions and iteratively finds the SFC processing policy in the network environment. Furthermore, an SFC data plane protocol based on segment routing over IPv6 configures and operates the policy in the SFC data network. Evaluation results show that DeepNFP can achieve 46% of the SFC completion time and 66% of the network overhead compared with conventional SFC and NFP, respectively.
- KSP Keywords
- Completion Time, Data network, Data plane, Deep reinforcement learning, Learning network, Learning-based, Network Environment, Network dynamics, Network functions, Network overhead, Parallel Processing
This work is distributed under the term of Korea Open Government License (KOGL)
(Type 4: : Type 1 + Commercial Use Prohibition+Change Prohibition)
(Type 4: : Type 1 + Commercial Use Prohibition+Change Prohibition)
