Sung-Min Oh

Sung-Min Oh

Auto-generated profile, based on publicly available information

Sung-Min Oh

ETRI, Commun & Internet Res Lab, Daejeon, South Korea

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2015 in ETRI Journal
Verified
Journal Article
Closed access
PDF file
CLChoong-Hee Lee
Choong-Hee Lee
SLSung-Hyung Lee
Sung-Hyung Lee
KGKwang-Chun Go
Kwang-Chun Go
SOSung-Min Oh
Sung-Min Oh
JSJae Sheung Shin
Jae Sheung Shin
Jae-Hyun KimJae-Hyun Kim
Jae-Hyun Kim

1 October 2015 in ETRI Journal
Verified
Journal Article
Closed access
PDF file
SOSung-Min Oh
Sung-Min Oh
CLChanghee Lee
Changhee Lee
JLJeong-Hwan Lee
Jeong-Hwan Lee
APAe-Soon Park
Ae-Soon Park
JSJae Sheung Shin
Jae Sheung Shin

20 January 2026 in arXiv
Verified
Preprint
Open access
PDF file
SKSivaram Krishnan
Sivaram Krishnan
ZGZhouyou Gu
Zhouyou Gu
JPJihong Park
Jihong Park
SOSung-Min Oh
Sung-Min Oh
JCJinho Choi
Jinho Choi
The proliferation of large-scale low Earth orbit (LEO) satellite constellations is driving the need for intelligent routing strategies that can effectively deliver data to terrestrial networks under rapidly time-varying topologies and intermittent gateway visibility. Leveraging the global control capabilities of a geostationary (GEO)-resident software-defined networking (SDN) controller, we introduce opportunistic routing, which aims to minimize delivery delay by forwarding packets to any currently available ground gateways rather than fixed destinations. This makes it a promising approach for achieving low-latency and robust data delivery in highly dynamic LEO networks. Specifically, we formulate a constrained stochastic optimization problem and employ a residual reinforcement learning framework to optimize opportunistic routing for reducing transmission delay. Simulation results over multiple days of orbital data demonstrate that our method achieves significant improvements in queue length reduction compared to classical backpressure and other well-known queueing algorithms.