Dohyung Kim

2024

1. SAC

   Rescuing QUIC Flows From Countermeasures Against UDP Flooding Attacks

   Junseok Lee, Minhyeong Kim, Wonjun Song, and 2 more authors

   In Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing, 2024

   Abs Bib Best paper

   Due to advantages such as quick connection establishment and multiple streaming over a single connection, QUIC was included in the new standard of HTTP 3.0 as an alternative transport layer protocol. Since QUIC operates on UDP, however, QUIC flows can be blocked by existing countermeasures against UDP flooding attacks, even if transmission rates are fairly controlled by congestion control algorithms, such as TCP. In this paper, we confirm that such a problem arises in real-world Internet environment and design effective approaches to avoid it. In the first approach, the gateway router dynamically sets the rate limit for the QUIC flow, based on the expected next CWND size estimated by the receiver using a built-in congestion control algorithm. The second approach leverages the proactive dropping of packets (or ECN marking) to distinguish whether the flow is a self-regulated QUIC flow or an unresponsive UDP attack/selfish flow. Simulation studies using the ns-3 simulator confirm that the proposed approaches can selectively allow QUIC flows regardless of their short-term transmission rates while preserving the effectiveness of existing countermeasures against UDP flooding attacks.

   @inproceedings{lee2024rescuing,
     title = {Rescuing QUIC Flows From Countermeasures Against UDP Flooding Attacks},
     author = {Lee, Junseok and Kim, Minhyeong and Song, Wonjun and Kim, Younghoon and Kim, Dohyung},
     booktitle = {Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing},
     pages = {1072--1080},
     year = {2024},
     organization = {ACM/SIGAPP},
     award = {Our team received the best paper award in ACM SAC 2024 - https://www.sigapp.org/sac/sac2024/},
     award_name = {Best paper},
   }

   Our team received the best paper award in ACM SAC 2024 - https://www.sigapp.org/sac/sac2024/

2. T-IV

   What If Vehicles are Controlled by the Road?

   Junhyeok Hwang, Keun-Woo Lim, and Dohyung Kim

   IEEE Transactions on Intelligent Vehicles, 2024

   Abs Bib

   Recently, self-driving vehicles have been actively studied and have begun to operate on actual roads. Most of the current self-driving vehicles rely on a number of sensors to individually judge the situation and take action. However, from a road perspective, a collection of individual vehicles’ decisions is inevitably sub-optimal, and it is essential that roads directly intervene (control/assist) in vehicle operation for optimal traffic management. This paper proposes Software-Defined Traffic Management (SDTM) that incorporates the concept of Software-Defined Networking (SDN) into the transportation environment. In SDTM, each vehicle is handled like a packet in SDN and its movement can be assisted/controlled using a global view of the road. To this end, SDTM enables reliable interaction between vehicles and infrastructure (RSU/controller) by 1) allocating collision-free channels to vehicles, 2) reducing vehicle’s messaging interval by fully utilizing available channel resources, and 3) redistributing sensitive information from the infrastructure. Based on the traffic information collected and reported by RSU, the controller induces vehicle to form clusters and controls/assists the movement of vehicles on a cluster-by-cluster basis, implementing safe and efficient traffic flows. According to the performance evaluation using the ns-3 simulator, under SDTM, vehicles experience an average travel time reduced by 30% (more than 97% of all vehicles experience shorter travel time) compared to the real traffic traces, while maintaining a safety distance.

   @article{hwang2024if,
     title = {What If Vehicles are Controlled by the Road?},
     author = {Hwang, Junhyeok and Lim, Keun-Woo and Kim, Dohyung},
     journal = {IEEE Transactions on Intelligent Vehicles},
     year = {2024},
     publisher = {IEEE},
   }

2020

1. TPDS

   T-caching: Enhancing feasibility of in-network caching in ICN

   Sugi Lee, Ikjun Yeom, and Dohyung Kim

   IEEE Transactions on Parallel and Distributed Systems, 2020

   Abs Bib

   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.

   @article{lee2020t,
     title = {T-caching: Enhancing feasibility of in-network caching in ICN},
     author = {Lee, Sugi and Yeom, Ikjun and Kim, Dohyung},
     journal = {IEEE Transactions on Parallel and Distributed Systems},
     volume = {31},
     number = {7},
     pages = {1486--1498},
     year = {2020},
   }

2017

1. TIFS

   Security of cached content in NDN

   Dohyung Kim, Jun Bi, Athanasios V Vasilakos, and 1 more author

   IEEE Transactions on Information Forensics and Security, 2017

   Abs Bib

   In 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.

   @article{kim2017security,
     title = {Security of cached content in NDN},
     author = {Kim, Dohyung and Bi, Jun and Vasilakos, Athanasios V and Yeom, Ikjun},
     journal = {IEEE Transactions on Information Forensics and Security},
     volume = {12},
     number = {12},
     pages = {2933--2944},
     year = {2017},
     publisher = {IEEE},
   }

2016

1. Ad Hoc Netw.

   Efficient content delivery in mobile ad-hoc networks using CCN

   Dohyung Kim, Jong-hwan Kim, Cheoleun Moon, and 2 more authors

   Ad Hoc Networks, 2016

   Abs Bib

   Information-centric networking (ICN) is emerging as a future network technology. It has introduced the great advantage of information dissemination with low bandwidth consumption in wired testbed networks. Recently, ICN is also studied for mobile ad-hoc networks environments for efficient content distribution. In the existing works in the literature, broadcast delivery is actively utilized for designing new routing schemes since it seems well fitted to the nature of ICN conceptually. In this paper, we raise questions about this research direction by analysing the performance of reliability and energy efficiency of both broadcast and unicast delivery schemes. Our analysis shows that unicast delivery outperforms broadcast delivery, unless topological changes incur too much packet flooding overhead. Based on this observation, we present a novel energy efficient content distribution scheme that delivers the content in a unicast manner while minimizing flooding overhead by taking advantage of ICN features. Via ns-3 simulation, we compare the performance of the proposed scheme with that of other comparative schemes, and show that the proposed scheme achieves much higher reliability and energy efficiency in content distribution under mobile ad-hoc network environments.

   @article{kim2016efficient,
     title = {Efficient content delivery in mobile ad-hoc networks using CCN},
     author = {Kim, Dohyung and Kim, Jong-hwan and Moon, Cheoleun and Choi, Jeonghwan and Yeom, Ikjun},
     journal = {Ad Hoc Networks},
     volume = {36},
     pages = {81--99},
     year = {2016},
     publisher = {Elsevier},
   }

2015

1. ICN

   Efficient content verification in named data networking

   Dohyung Kim, Sunwook Nam, Jun Bi, and 1 more author

   In Proceedings of the 2nd ACM Conference on Information-Centric Networking, 2015

   Abs Bib

   In Named Data Networking, contents are retrieved from network caches as well as the content server by their name. This aspect arises severe security concerns on content integrity. Especially, if poisoned contents lie in the network cache, called content store(CS), interests would be served by the poisoned content rather than they propagate toward the content server. Consequently, users whose interests pass through the contaminated CS cannot access the valid content. In order to resolve the problem, every content is verified before they are inserted into the CS. However, this built-in verification mechanism is not practically feasible due to its huge computational overhead. In this paper, we address problems of content integrity in NDN in details, including how to violate content integrity. We also propose a practical solution that efficiently detects poisoned contents from the CS with minimum overhead. Since the proposed scheme aligns to the basic NDN architecture, it is a practical and effective solution.

   @inproceedings{kim2015efficient,
     title = {Efficient content verification in named data networking},
     author = {Kim, Dohyung and Nam, Sunwook and Bi, Jun and Yeom, Ikjun},
     booktitle = {Proceedings of the 2nd ACM Conference on Information-Centric Networking},
     pages = {109--116},
     year = {2015},
     organization = {ACM},
   }

2012

1. ICN

   Mobility support in content centric networks

   Do-hyung Kim, Jong-hwan Kim, Yu-sung Kim, and 2 more authors

   In Proceedings of the second edition of the ICN workshop on Information-centric networking, 2012

   Abs Bib

   Content-centric networking (CCN) is designed for efficient dissemination of information. Several architectures are proposed for CCN recently, but mobility issues are not considered sufficiently. We classify traffic types of CCN into real-time and non real-time. We examine mobility problems for each type, and suggest the possible hand-off schemes over CCN. Then, we analyze the delay performance in terms of simulation study. We believe that the proposed schemes can be merged as a part of the CCN easily, since they comply with the inherent nature and rules of the CCN.

   @inproceedings{kim2012mobility,
     author = {Kim, Do-hyung and Kim, Jong-hwan and Kim, Yu-sung and Yoon, Hyun-soo and Yeom, Ikjun},
     booktitle = {Proceedings of the second edition of the ICN workshop on Information-centric networking},
     pages = {13--18},
     year = {2012},
     organization = {ACM},
   }