Yu-Ting Wang 0002

dblp:09/8269-2 · also Yuting Wang 0002 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
6since 2021 · last 2024
0000-0002-6029-6814ORCID · conflict

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

Computer networks · 7 · 1 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2024 Markov Clustering-Based Content Placement in Roadside-Unit Caching With Deadline Constraint
abstract
With the explosive growth of mobile data traffic, roadside-unit (RSU) caching is considered an effective way to offload download traffic in vehicular ad hoc networks (VANETs). Many existing works investigate the content placement of RSU caching. However, few of them consider the download deadline constraint when caching the content in the RSUs. In this paper, the main objective is to maximize the hit rate of downloading the requested content from the RSUs before the deadline expires. We propose a Markov-based mobility model and a Markov clustering-based content placement algorithm to group the RSUs into clusters and allocate the content to the cache of the RSUs in the cluster. We also investigate the impact on the cache hit rate under different simulation parameters, such as the total number of RSUs, the cache size, and the number of RSUs visited by vehicles during the download period. According to the simulations conducted, when the region of interest (RoI) is small, the MVP method increases the cache hit rate by at least 21.40% compared to the existing methods. When the RoI is large, our approach outperforms other existing methods by at least 26.16% and at most 337.77%, which significantly increases the efficiency of the download session in VANET.
Yu-Ting Wang 0002, Sok-Ian Sou, Lo-An Chen, Meng-Hsun Tsai, Yean-Ru Chen, Chia-Heng Tu
IEEE Trans. Intell. Transp. Syst.1
2023 Reducing Redundant Transmissions for Message Broadcast in Vehicular Ad Hoc Networks
abstract
As the number of autonomous cars grows explosively, it is important to broadcast messages with less time and fewer transmissions, especially emergency messages. Therefore, we present an efficient way to broadcast messages by recording the information of informed and uninformed nodes and adopt the mechanism into the push-pull algorithm for vehicular ad hoc networks.
Yu-Ting Wang 0002, Meng-Hsun Tsai, Akira Matsubayashi
CCNC1
2023 Improving QoS mechanisms for IEEE 802.11ax with overlapping basic service sets
Ya-Pei Tuan, Lo-An Chen, Ting-Yen Lin, Yu-Ting Wang 0002, Sok-Ian Sou, Meng-Hsun Tsai
Wirel. Networks5
2022 Mitigating New-Flow Attack with SDNSnapshot in P4-based SDN
abstract
In software-defined networking (SDN), emerging new-flow attacks aim at exhausting the resources of switches and controllers through massive packet-in messages. To detect new-flow attacks, SDNGuardian was proposed as a protocol-independent defense method, which uses entropy to detect anomalies and mitigate attacks with rate limits. In this paper, we introduce a crafty new-flow attack named timeout-aware attack that SDNGuardian cannot detect. We, therefore, propose a novel defense method: SDNSnapshot. Through simulations, we show that SDNSnapshot can successfully detect the timeout-aware attack. The number of dropped benign packet-in messages in SDNSnapshot is around one third of that in SDNGuardian. Besides, a snapshot only consumes 0.9Mb static random access memory (SRAM) for each anomalous sensitive field. The results indicate that SDNSnapshot is a feasible solution to mitigate new-flow attacks in practice.
Yun-Zhan Cai, Yu-Ting Wang 0002, Ya-Pei Tuan, Meng-Hsun Tsai
APNOMS3
2022 Reducing download delay for cooperative caching in small cell network
Yu-Ting Wang 0002, Yun-Zhan Cai, Lo-An Chen, Sian-Jhe Lin, Ren-Shiou Liu, Meng-Hsun Tsai
Wirel. Networks1
2021 Dynamic adjustment for proactive flow installation mechanism in SDN-based IoT
Yun-Zhan Cai, Yu-Ting Wang 0002, Meng-Hsun Tsai
Comput. Networks2
2020 Improving Scanner Data Collection in P4-based SDN
abstract
Port scanning is a well-known behavior when a botnet searches target devices. To detect port scanning accurately, data with high discriminatory power are indispensable. Most related works, however, focus on data analysis methods but neglect storage limitations of switches, which makes their methods impractical. Therefore, we propose a new data collection method for collecting network information of port scanning in P4-based SDN named 0-replacement. Through simulations, we compare the 0-replacement method with two classic data collection methods. Results show that the 0-replacement method improves the true positive ratio by at least 25 percentage points but only consumes 0.36% memory space.
Yun-Zhan Cai, Chih-Hao Lai, Yu-Ting Wang 0002, Meng-Hsun Tsai
APNOMS3
2020 Mitigating SYN flooding Attack and ARP Spoofing in SDN Data Plane
abstract
As the number of network devices increases rapidly, it becomes more and more difficult to defend network attacks. Large-scaled attacks, such as SYN flooding, may lead to heavy burden to the switches as well as the controller in a software defined network (SDN). In this paper, we investigate the SYN flooding and Address Resolution Protocol (ARP) spoofing attacks in SDN, and then propose mechanisms to address these two attacks. We also present a new scheme to detect SYN flooding by using only a few forwarding rules. Moreover, we utilize the Programming Protocol-independent Packet Processors (P4) technique to mitigate the burden of the controller.
Jhen-Ping Wu, Pei-Hsuan Hung, Ching-Hsuan Shao, Yu-Ting Wang 0002, Yun-Zhan Cai, Meng-Hsun Tsai
APNOMS5
2020 Periodic Subflow-based Proactive Flow Installation Mechanism in SDN-based IoT
abstract
Software-defined Network (SDN) is considered as a promising technology to provide a flexible network for 5G. However, as the resource of flow entries in switches is limited in SDN, a novel flow management method is required when facing massive amounts of IoT devices. To the best of our knowledge, existing methods designed for IoT can only be applied to uncomplicated network environments without multiple periodic traffic flows. In this paper, we propose Periodic Subflow-based Proactive Flow Installation Mechanism (PSPFIM), a more widely applicable method with better performance. Compared to related works, we improve the hit ratio by 45% and installation efficiency by 6.19 times according to results of simulations, which means PSPFIM can reduce the average network latency with even less flow entries.
Yun-Zhan Cai, Shao-Ku Tien, Yu-Ting Wang 0002, Meng-Hsun Tsai
GLOBECOM3
2019 Backhaul-Based Cooperative Caching in Small Cell Network
Yu-Ting Wang 0002, Yun-Zhan Cai, Lo-An Chen, Sian-Jhe Lin, Meng-Hsun Tsai
AINA1