Skip to content

Author

Ren-Hung Hwang

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

2026

Bridging Training–Deployment Gap in Intrusion Detection With Source-Free Domain Adaptation

Machine learning (ML)–based intrusion detection systems (IDS) frequently degrade when deployed across heterogeneous networks due to domain shifts in traffic composition and monitoring configurations. Conventional domain adaptation (DA) methods mitigate this issue by aligning source and target distributions, but they often rely on retaining source-domain data at deployment—an impractical requirement that undermines operational scalability and reusability. To address this gap, we propose TRANSFA-IDS (Transformer Source-Free Adaptation for IDS), a lightweight source-free adaptation framework that recalibrates a source-trained IDS using only target traffic data. TRANSFA-IDS converts tabular flow records into structured RGB image embeddings and employs a compact Vision Transformer with a Deep Support Vector Data Description (Deep-SVDD) head to learn transferable normal representations. At deployment, adaptation is performed by fine-tuning only the last transformer block on a small target buffer, realigning target representations without retraining or access to source data. Experiments on cross-dataset transfer between CIC-IDS-2018 and UNSW-NB15 show that TRANSFA-IDS achieves AUROC of 0.9177 and 0.9071 in the two transfer directions, reduces target-domain benign false positives by over 60% relative to the same source-pretrained model deployed without source-free adaptation, and adapts substantially faster than supervised and unsupervised DA baselines while using at most 20% of the target-domain data. These results indicate that source-free adaptation can achieve both strong detection performance and a practical deployment-oriented design, with cross-benchmark evidence of scalable adaptation across heterogeneous network environments.

Didik Sudyana, Wong Yu Xuan, Laurens D’hooge et al. · 0 citations
Open access Aug 2026

Proximal Policy Optimization for Latency-Aware Service Function Chain Placement in Edge-Enabled Networks

Modern networked systems are progressively adopting network virtualization and Service Function Chaining (SFC) to deliver scalable, flexible and low-latency services. A central challenge in this context is the Service Function Chain Placement Problem (SFC-PP), which involves efficiently placing Virtualized Network Functions (VNFs) under stringent resource constraints and Quality of Service (QoS) requirements in dynamic network environments. To address this, we propose an enhanced Proximal Policy Optimization (PPO) framework for resource-aware and latency-sensitive SFC placement in edge-enabled networks. Our approach incorporates network performance metrics into the PPO learning pipeline through delay-aware reward design, resource-aware state representation and feasibility-aware action masking, thereby improving policy stability and infrastructure utilization. Extensive evaluations on multiple topologies including RNET, NSFNET, GBN and GEANT2 demonstrate that the proposed PPO significantly outperforms the Random Selection (RS), Q-Learning (QL) and Deep Q-Network (DQN) baselines, achieving up to 31% higher service acceptance, with reduced service latency and improved resource efficiency. A healthcare-oriented case study demonstrates the applicability of the proposed framework in mission-critical and latency-sensitive service environments. These results highlight PPO as a robust and scalable solution for intelligent service orchestration in dynamic network environments.

Nithin Melala Eshwarappa, Ching-Hsien Hsu, Hojjat Baghban et al. · 0 citations