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

Jiwoong Won

dblp:168/6404 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0002-2045-7636ORCID · corroborated

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

Computer networks · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
1 paper
Content delivery and video streaming · 100%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

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

TopicWeightPapersLastEvidence papers
Content delivery and video streaming › prefetching
web prefetching
0.412019
Intentionality-related Deep Learning Method in Web Prefetching · ICNP 2019
Machine learning › Deep learning architectures and training › recurrent neural network
LSTM
0.112019
Intentionality-related Deep Learning Method in Web Prefetching · ICNP 2019
Machine learning › Deep learning architectures and training
recurrent neural network
0.112019
Intentionality-related Deep Learning Method in Web Prefetching · ICNP 2019

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

skip-gram embedding · 0.8LSTM · 0.8
YearPublicationVenuePosition
2019 Intentionality-related Deep Learning Method in Web Prefetching
abstract
Many prediction models have been proposed to improve the effectiveness of web prefetching for reducing the response time perceived by users when browsing the web. Most of these models are based on structure learning and are applied at the client side. Currently, considerable attention is being paid to proxy-based prefetching because it is more effective and accurate in predicting the correlated pages of many websites of similar interest for more homogeneous users. Compared with client-based prefetching, more complex prediction tasks must run in the proxy, which implies that a more powerful prediction model is required. Thus, based on the time-series characteristics of browsing records, we proposed the intentionality-related long short-term memory (Ir-LSTM) model, which combines both the Skip-Gram embedding method and the LSTM model while expanding the input features with user information. We also propose a novel dynamic allocation module for detecting real-time traffic bursts and correspondingly adjusting the correlation coefficient of the model's output to achieve higher server-side resource utilization while fully maximizing hit ratio.
Wenbo Zou, Jiwoong Won, Jemin Ahn, Kyungtae Kang
ICNP2
2017 Trapfetch: A breakpoint-based prefetcher for both launch and run-time
abstract
TrapFetch is trained by monitoring the read requests issued by an application. It detects bursts of disk reads, determines the appropriate addresses at which breakpoints should be inserted in the application and library codes prior to the bursts of reads, and then logs this information with the data requested during the interval between each consecutive pair of breakpoints. When the application and library codes are loaded from the disk into memory, TrapFetch inserts breakpoints at the designated addresses based on the logs. During subsequent runs, TrapFetch is invoked at each breakpoint when it prefetches the corresponding data into the page cache. This approach is effective during both launch and run-time. TrapFetch operates at the user level, thus avoiding interference with other applications. In experiments on five popular applications (FlightGear, SpeedDreams 2, Pillars of Eternity, Eclipse, and VegaStrike), TrapFetch reduced the time for launch by up to 39.7% and time for run-time data-loading by up to 63.7%.
Jiwoong Won, Oseok Kwon, Junhee Ryu, Junbeom Hur, Insup Lee 0001, Kyungtae Kang
SMC1