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

Sugi Lee

dblp:162/1566 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
2since 2021 · last 2024
0000-0002-6823-0203ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 first-author · 1 since 2021Computer networks · 2 · 1 first-author · 1 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
Internet architecture and protocols · 57% Content delivery and video streaming · 28% Datacenter networks · 15%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 100%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip
remote direct memory access
0.812024
PeRF: Preemption-enabled RDMA Framework · USENIX ATC 2024
Content delivery and video streaming › caching
cache management
0.412020
T-Caching: Enhancing Feasibility of In-Network Caching in ICN · IEEE Trans. Parallel Distributed Syst. 2020
Internet architecture and protocols
information-centric networking
0.412020
T-Caching: Enhancing Feasibility of In-Network Caching in ICN · IEEE Trans. Parallel Distributed Syst. 2020
Internet architecture and protocols › information-centric networking
in-network caching
0.412020
T-Caching: Enhancing Feasibility of In-Network Caching in ICN · IEEE Trans. Parallel Distributed Syst. 2020
Datacenter networks
RDMA
0.212024
PeRF: Preemption-enabled RDMA Framework · USENIX ATC 2024

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

preemption · 1.5trace analysis · 0.4simulation · 0.4
YearPublicationVenuePosition
2024 PeRF: Preemption-enabled RDMA Framework
Sugi Lee, MinGyu Choi, Ikjun Yeom
USENIX ATC1
2023 Self-Attention-Based Uplink Radio Resource Prediction in 5G Dual Connectivity
abstract
Mobile communication technology is evolving rapidly and becoming increasingly ubiquitous, thereby increasing the demand for uplink data-intensive applications (e.g., personal broadcasting and live augmented/virtual reality videos). Recently, to facilitate a cost-effective and smooth transition from 4G to 5G networks, most carriers leverage existing 4G infrastructures using a dual connectivity (DC) feature. DC increases uplink throughput and mobility robustness; however, it also causes unprecedented dynamic fluctuations in radio channels due to the coverage discrepancy between 4G and 5G networks. Thus, in this article, we propose a self-attention-based deep learning model to predict uplink radio resources in 5G DC. We trained the proposed model on commercial 5G DC traffic data from three major carriers in South Korea and obtained an average prediction accuracy of 95.08% under various mobility and cell-load conditions. The proposed model explains the rationale for the obtained predictions by highlighting the parts of the input time-series data that are important to realize accurate prediction. We also demonstrate the usability of the proposed model using a network emulator based on real-world 5G trace data. Extensive evaluations demonstrate that the existing congestion control algorithms can achieve excellent performance when used with the proposed model.
Jewon Jung, Sugi Lee, Jaemin Shin 0002, Yusung Kim 0001
IEEE Internet Things J.2
2020 T-Caching: Enhancing Feasibility of In-Network Caching in ICN
abstract
In Information-Centric Networking (ICN), in-network caching is one of the core functions to implement efficient content distribution. As content is served from the network cache, redundant transmission across the same link is reduced and better quality services are provided to the user. However, caching operations (locating cached content, validating/writing content to the cache) may be a large burden on routers. In this article, we substantially reduce the caching overhead of routers by introducing T-Caching, a new in-network caching model in which routers selectively cache some of the most popular content recommended by content providers. In T-Caching, tokens are used 1) to enable routers to maximize caching benefits by simply controlling the amount of content inserted into the cache; 2) to allow content providers to recommend the most popular content as much as routers would actually cache. Our simulation and empirical studies using synthetic data, as well as real-world traces, show that T-Caching allows routers to insert much less than 1 percent of the content into the cache, compared to typical caching mechanisms. Nevertheless, the cache-hit ratio is improved by up to 2~9 times depending on the cache size. We believe that T-Caching can significantly contribute to improving feasibility and performance of in-network caching in ICN.
Sugi Lee, Ikjun Yeom, Dohyung Kim 0005
IEEE Trans. Parallel Distributed Syst.1
2017 Active request management in stateful forwarding networks
Sugi Lee, Ikjun Yeom, Yusung Kim 0001
J. Netw. Comput. Appl.1