Yutaro Yoshinaka
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yutaro Yoshinaka has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Yuki Koizumi
Graduate School of Information Science and Technology, Osaka University, Osaka, Japan
4 shared publications - Junji Takemasa
Graduate School of Information Science and Technology, Osaka University, Osaka, Japan
3 shared publications - Toru Hasegawa
Faculty of Materials for Energy, Shimane University, Matsue, Shimane, Japan
2 shared publications - Elisa Rojas
Universidad de Alcalà
1 shared publication Javier Diaz-Fuentes
Universidad de Alcalà
1 shared publicationJunji Takemasa
1 shared publication
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Networking Letters
- p. 1
Towards Adaptive Lightweight Layers of Privacy for the Edge
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Networking Letters
- p. 1
Open AccessTowards Adaptive Lightweight Layers of Privacy for the Edge
- 30 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (6) , 3196-3211
Payload Queueing for Optimizing Complex Header Processing in Programmable Switches
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.
- 30 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (6) , 3196-3211
Payload Queueing for Optimizing Complex Header Processing in Programmable Switches
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.
- 20 August 2024
- Published by Elsevier in Computer Networks
- Vol. 253
A lightweight anonymity protocol at terabit speeds on programmable switches
- 20 August 2024
- Published by Elsevier in Computer Networks
- Vol. 253
A lightweight anonymity protocol at terabit speeds on programmable switches
- 11 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (3) , 2460-2474
Programmable Name Obfuscation Framework for Controlling Privacy and Performance on CCN
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.
- 11 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 20 (3) , 2460-2474
Programmable Name Obfuscation Framework for Controlling Privacy and Performance on CCN
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.