Yutaro Yoshinaka

Yutaro Yoshinaka

Auto-generated profile, based on publicly available information

Yutaro Yoshinaka

University of Osaka

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
20 August 2024 in Computer Networks
Verified
Journal Article
Closed access
YYYutaro Yoshinaka
Yutaro Yoshinaka
MKMio Kochiyama
Mio Kochiyama
YKYuki Koizumi
Yuki Koizumi
JTJunji Takemasa
Junji Takemasa
THToru Hasegawa
Toru Hasegawa

30 June 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
YYYutaro Yoshinaka
Yutaro Yoshinaka
YKYuki Koizumi
Yuki Koizumi
JTJunji Takemasa
Junji Takemasa
THToru Hasegawa
Toru Hasegawa
Programmable switches offer a promising platform for fast and flexible in-network computing. However, a standard mechanism, packet recirculation, degrades throughput due to bandwidth consumption caused by the loopback of not only packet headers but also cumbersome payloads. This paper proposes P4QRS, a mechanism that reduces payload recirculation by retaining payloads within the switch. Specifically, P4QRS bifurcates packets into headers and payloads, which undergo the computation process through pipelines and the buffering process leveraging the switch’s queue behavior, respectively. The headers and payloads then rendezvous for reassembly into complete packets to be sent out. To validate its effectiveness, we evaluated P4QRS through both an analytical model and implementation on state-of-the-art hardware programmable switches. Our results demonstrate that P4QRS operates stably and significantly accelerates complex in-switch computations. Moreover, we address packet reordering, which is a fundamental concern arising because P4QRS performs payload buffering on a per-packet basis rather than per-flow. After identifying the mechanism for developing packet reordering in three stages, we design, implement, and evaluate mitigation strategies targeting each stage. These strategies effectively suppress packet reordering in both flow-aware and flow-unaware cases.

11 May 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
YYYutaro Yoshinaka
Yutaro Yoshinaka
KKKentaro Kita
Kentaro Kita
JTJunji Takemasa
Junji Takemasa
YKYuki Koizumi
Yuki Koizumi
THToru Hasegawa
Toru Hasegawa
Consumer privacy leakage from data names poses a serious threat to Content-Centric Networking (CCN) networks. Obfuscating names is a promising countermeasure, and anonymizers with deterministic encryption schemes have been proposed to provide data privacy while enabling CCN features, such as in-network caching. Existing studies assume a weak threat model in which anonymizers are honest, and their obfuscation schemes are not resilient against privacy attacks such as name guessing attacks. This paper designs a name obfuscation framework based on the realistic assumption that anonymizers are semi-honest. The framework strengthens data privacy using multiple keys and separates obfuscation for prefixes and suffixes, and is implemented on a P4 switch to provide Tbps forwarding speed.

1 January 2026 in IEEE Networking Letters
Verified
Journal Article
Open access
JDJavier Diaz-Fuentes
Javier Diaz-Fuentes
YYYutaro Yoshinaka
Yutaro Yoshinaka
Elisa RojasElisa Rojas
Elisa Rojas
JTJunji Takemasa
Junji Takemasa
YKYuki Koizumi
Yuki Koizumi