Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sugyeong Lee

dblp:378/3541 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Vehicular, aerial and satellite networks · 52% Edge and fog computing · 29% Routing and switching · 14%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Vehicular, aerial and satellite networks
satellite networks
1.122025
Poster: A Routing Algorithm for Enhancing TCP Performance in LEO Satellite Networks · ICNP 2025
Poster: Computation-efficient Decentralized Federated Learning in LEO Satellite Network · ICNP 2025
Edge and fog computing › distributed learning
decentralized federated learning
0.912025
Poster: Computation-efficient Decentralized Federated Learning in LEO Satellite Network · ICNP 2025
Vehicular, aerial and satellite networks › satellite network routing
inter-satellite link routing
0.912025
Poster: A Routing Algorithm for Enhancing TCP Performance in LEO Satellite Networks · ICNP 2025
Vehicular, aerial and satellite networks › satellite networks
LEO satellite routing
0.912025
Poster: A Routing Algorithm for Enhancing TCP Performance in LEO Satellite Networks · ICNP 2025
Routing and switching
routing algorithms
0.912025
Poster: A Routing Algorithm for Enhancing TCP Performance in LEO Satellite Networks · ICNP 2025
Edge and fog computing
satellite edge computing
0.912025
Poster: Computation-efficient Decentralized Federated Learning in LEO Satellite Network · ICNP 2025
Distributed systems › distributed machine learning
distributed training
0.912025
Poster: Computation-efficient Decentralized Federated Learning in LEO Satellite Network · ICNP 2025
Vehicular, aerial and satellite networks › satellite networks
LEO satellite networks
0.312025
Poster: Computation-efficient Decentralized Federated Learning in LEO Satellite Network · ICNP 2025
Transport protocols and congestion control
TCP performance
0.312025
Poster: A Routing Algorithm for Enhancing TCP Performance in LEO Satellite Networks · ICNP 2025

Methods — techniques the papers use, named apart from their topics

overlay network construction · 1.7optimization · 1.7federated learning · 1.7simulation · 0.9
YearPublicationVenuePosition
2025 Poster: Computation-efficient Decentralized Federated Learning in LEO Satellite Network
abstract
Decentralized satellite federated learning (DSFL) enables LEO satellites to collaboratively train models without relying on terrestrial infrastructures. In DSFL, concurrent model updates for multiple services increase the amount of computation on the satellite, which can lead to longer total training time. This paper proposes a computation-efficient DSFL framework to construct the overlay network for services to minimize the total training time. Simulation results demonstrate that the proposed scheme outperforms the baseline algorithms in terms of total training time.
Anna Cho, Gayeong Lee, Sugyeong Lee
ICNP3
2025 Poster: A Routing Algorithm for Enhancing TCP Performance in LEO Satellite Networks
abstract
The rapid changes in network topology caused by the mobility of LEO satellites lead to inter-satellite link (ISL) disconnections. Accordingly, such disconnections will degrade TCP throughput of LEO services. In this paper, we propose a routing algorithm for LEO satellite networks that reduces path changes by avoiding ISLs prone to disconnection. The simulation results demonstrate that the proposed algorithm achieves higher TCP throughput compared to the benchmark methods.
Yoonsoo Choi, Jaeseong Park, Sugyeong Lee, Gayeong Lee
ICNP3