Won-Kyeong Seo

Won-Kyeong Seo

Auto-generated profile, based on publicly available information

Won-Kyeong Seo

Department of Military Electronic Communication, Yeungjin University, Daegu, South Korea

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 February 2021 in IEEE Access
Verified
Journal Article
Open access
YSYeong-Jun Song
Yeong-Jun Song
Geon-Hwan KimGeon-Hwan Kim
Geon-Hwan Kim
Imtiaz MahmudImtiaz Mahmud
Imtiaz Mahmud
WSWon-Kyeong Seo
Won-Kyeong Seo
YCYou Ze Cho
You Ze Cho
Google proposed a bottleneck bandwidth round-trip propagation time (BBR) for TCP to replace the loss-based congestion control algorithms, such as Reno and CUBIC. Unlike the loss-based algorithms, BBR models a network path from source to destination and dynamically controls the sending rate using control parameters, such as pacing rate, congestion window, and quantum to achieve high throughput and low latency. However, many studies have reported performance issues in BBR operation, such as excessive packet loss in shallow buffers, the unfairness among different RTT flows, the unfairness with loss-based algorithms, and so on. Google is developing a new version of BBR, BBRv2, to resolve these performance issues. In this study, we evaluate and compare two versions of BBR on a Mininet emulator and a physical testbed, focusing on whether the BBRv2 alpha can alleviate the performance issues of BBRv1 and whether other novel issues will arise in BBRv2. The experiment results show that BBRv2 improves the unfairness and aggressiveness in small buffer less than 1 BDP. Moreover, multiple BBRv2 flows not only show better fairness in bandwidth sharing, but also reduce the amount of packet retransmissions. However, we observed that the challenging issues such as RTT unfairness, coexistence with loss-based algorithms, and synchronization between BBRv2 flows still exist. This study explores BBRv2’s current behavior in various network scenarios and compares the performance of BBRv2 with the BBRv1 congestion control algorithm.

1 May 2012
Verified
Conference Paper
Closed access
DKDong-Won Kum
Dong-Won Kum
WSWon-Kyeong Seo
Won-Kyeong Seo
JCJae-In Choi
Jae-In Choi
YCYou Ze Cho
You Ze Cho
Mobile Ad-hoc Networks (MANETs) require a dynamic and efficient routing protocol that can respond quickly to network topology changes. Ad hoc routing protocols for MANETs are classified into: (a) proactive, (b) reactive and (c) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in a MANET is mobile, yet it can also fluctuate between being mobile and being stationary. Thus, a hybrid routing approach with the ability to adapt to the node mobility could improve the performance of MANETs. In this paper, we propose a Mobility Adaptive Hybrid Routing (MAHR) for MANETs, which varies its routing between reactive approach and proactive approach to adapt to node mobility. The MAHR consists of three parts: (a) calculation of mobility ratio, (b) core node selection, and (c) procedure of hybrid routing. The simulation results showed that MAHR could achieve the advantages of both reactive and proactive routing approaches in performance.