EDBT 2026 Demo / reviewers in the wild / expert
Dohyung Kim 0005
dblp:06/10823 · also Do-Hyung Kim 0005, Do-hyung Kim 0005
· DBLP profile ↗
6ranked-venue papers
3as first author
0since 2021 · last 2020
0000-0002-6364-1505ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 4 · 2 first-authorSystems, architecture and hardware · 1Security and privacy · 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
2 papers |
Internet architecture and protocols · 71% Content delivery and video streaming · 29% | |
| Network and information security
1 paper |
Network security · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › information-centric networking
in-network caching |
0.5 | 2 | 2020 | T-Caching: Enhancing Feasibility of In-Network Caching in ICN · IEEE Trans. Parallel Distributed Syst. 2020 Security of Cached Content in NDN · IEEE Trans. Inf. Forensics Secur. 2017 |
Content delivery and video streaming › caching
cache management |
0.4 | 1 | 2020 | T-Caching: Enhancing Feasibility of In-Network Caching in ICN · IEEE Trans. Parallel Distributed Syst. 2020 |
Internet architecture and protocols
information-centric networking |
0.4 | 1 | 2020 | T-Caching: Enhancing Feasibility of In-Network Caching in ICN · IEEE Trans. Parallel Distributed Syst. 2020 |
Network security
content verification |
0.3 | 1 | 2017 | Security of Cached Content in NDN · IEEE Trans. Inf. Forensics Secur. 2017 |
Network security › network coding security
pollution attack |
0.3 | 1 | 2017 | Security of Cached Content in NDN · IEEE Trans. Inf. Forensics Secur. 2017 |
Internet architecture and protocols › information-centric networking
named data networking |
0.1 | 1 | 2017 | Security of Cached Content in NDN · IEEE Trans. Inf. Forensics Secur. 2017 |
Methods — techniques the papers use, named apart from their topics
signature verification · 0.6content store prioritization · 0.6trace analysis · 0.4simulation · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | T-Caching: Enhancing Feasibility of In-Network Caching in ICNabstractIn 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. | 3 |
| 2019 | When Blockchain Takes Care of the OLSR NetworkabstractOver the several years, lots of researches have focused on routing protocol for Mobile Ad-Hoc Networks (MANET). Optimized Link State Routing Protocol (OLSR) is one of the typical routing protocols standardized by IETF, but it is known to be vulnerable to many type of security attacks. In this paper, blockchain technology is applied to OLSR to complement security vulnerabilities and reduce the computational overhead in existing security solutions. May Thura Lwin, Young-Bae Ko, Dohyung Kim 0005 |
ICCCN | 3 |
| 2018 | ICN-Based Light-Weighted Mobility Support in IoTabstractIn Information-Centric Networking (ICN), name-based addressing and in-network caching allow content to be efficiently distributed/accessed. These properties of ICN have been researched in the arena of wireless domain to implement light-weighted communication protocols. In this paper, specifically, we present an ICN-based content delivery scheme for Internet-of-Things (IoT), and show how the proposed scheme support seamless hand-off. Donghyeok An, Dohyung Kim 0005 |
ICCCN | 2 |
| 2017 | Enhancing NDN feasibility via dedicated routing and caching
Dohyung Kim 0005 |
Comput. Networks | 1 |
| 2017 | Security of Cached Content in NDNabstractIn Named-Data Networking (NDN), content is cached in network nodes and served for future requests. This property of NDN allows attackers to inject poisoned content into the network and isolate users from valid content sources. Since a digital signature is embedded in every piece of content in NDN architecture, poisoned content is discarded if routers perform signature verification; however, if every content is verified by every router, it would be overly expensive to do. In our preliminary work, we have suggested a content verification scheme that minimizes unnecessary verification and favors already verified content in the content store, which reduces the verification overhead by as much as 90% without failing to detect every piece of poisoned content. Under this scheme, however, routers are vulnerable to verification attack, in which a large amount of unverified content is accessed to exhaust system resources. In this paper, we carefully look at the possible concerns of our preliminary work, including verification attack, and present a simple but effective solution. The proposed solution mitigates the weakness of our preliminary work and allows this paper to be deployed for real-world applications. Dohyung Kim 0005, Jun Bi, Athanasios V. Vasilakos, Ikjun Yeom |
IEEE Trans. Inf. Forensics Secur. | 1 |
| 2016 | Efficient content delivery in mobile ad-hoc networks using CCN
Dohyung Kim 0005, Cheoleun Moon, Jeonghwan Choi, Ikjun Yeom |
Ad Hoc Networks | 1 |