Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Keita Aoki

dblp:356/4441 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2025
0000-0003-2079-4031ORCID · corroborated

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

Computer networks · 3 · 3 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Datacenter networks · 65% Transport protocols and congestion control · 20% Routing and switching · 15%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Datacenter networks
RDMA
1.622025
Poster: Time Window ECN Filtering for Multiple-bottleneck RDMA Congestion Control · ICNP 2025
Poster: The Congestion Path Multiplicity Problem in RDMA Multicast Congestion Control · ICNP 2024
Datacenter networks › RDMA
RDMA congestion control
1.622025
Poster: Time Window ECN Filtering for Multiple-bottleneck RDMA Congestion Control · ICNP 2025
Poster: The Congestion Path Multiplicity Problem in RDMA Multicast Congestion Control · ICNP 2024
Transport protocols and congestion control › congestion management
multicast congestion control
0.812024
Poster: The Congestion Path Multiplicity Problem in RDMA Multicast Congestion Control · ICNP 2024
Routing and switching
multicast routing
0.812024
Poster: The Congestion Path Multiplicity Problem in RDMA Multicast Congestion Control · ICNP 2024
Transport protocols and congestion control
explicit congestion notification
0.312025
Poster: Time Window ECN Filtering for Multiple-bottleneck RDMA Congestion Control · ICNP 2025

Methods — techniques the papers use, named apart from their topics

time window filtering · 0.9congestion signal filtering · 0.8
YearPublicationVenuePosition
2025 Poster: Time Window ECN Filtering for Multiple-bottleneck RDMA Congestion Control
Keita Aoki, Miki Yamamoto
ICNP1
2025 Resource Allocation Based on Relation Information of Hidden Node for Minimizing Packet Error in LPWA
abstract
Low-power wide area networks (LPWANs) are wireless communication systems that enable long-distance communication with low power consumption, and have attracted attention as a wireless infrastructure for Internet of Things (IoT) systems. However, the long-distance nature of LPWANs can cause the hidden node problem, which results in a lower packet delivery ratio (PDR). To address the hidden node problem, this paper proposes a channel assignment method. First, we derive an approximate formula for PDR under the impact of hidden nodes, and then propose an optimal channel assignment method based on simulated annealing, using the derived formula. Simulation results confirm that the proposed method can mitigate the degradation of PDR and increase the capacity of LPWAN networks.
Keita Aoki, Osamu Takyu, Koichi Adachi, Mai Ohta, Takeo Fujii
VTC2025-Fall1
2024 Poster: The Congestion Path Multiplicity Problem in RDMA Multicast Congestion Control
abstract
In multicast RDMA, the sender overestimates congestion signals when multiple paths are congested. This congestion path multiplicity problem is hard to be resolved because RDMA sender cannot identify the sender of congestion signals due to RDMA protocol regulation. In this paper, we propose a new approach that the branching switch filters congestion signals from the worst congested interface. Our evaluation results show that our proposed method can adequately resolve the congestion path multiplicity problem.
Keita Aoki, Miki Yamamoto
ICNP1
2023 A Gateway Proxy with ECN Buffer Control for Inter-Datacenter Congestion Control
abstract
In a data center (DC) where inter- and intra-DC flows share high-speed data center networks (DCNs), these two types of flows have significantly different round-trip times (RTTs). When congestion occurs in a DCN, the congestion signal is detected first by the intra-DC flow, resulting in unfairness where only it reacts to congestion. This technical problem is especially important for the receiving DCN because the congestion point is far from the sender. To solve this issue, we propose DC performance enhancing proxy (DC-PEP) with ECN (Explicit Congestion Notification) buffer control as a proxy at the gateway of the receiving DCN. DC-PEP divides the end-to-end congestion control loop into two loops, which homogenizes the congestion loop inside the receiving DCN. To absorb the throughput difference between these two congestion loops, a buffer is required at DC-PEP. By implementing ECN-Echo notification, excessive queueing at DC-PEP can be avoided. Our simulation results show that our proposed DC-PEP with ECN improves fairness between inter- and intra-DC flows without incurring large queue sizes at the proxy.
Keita Aoki, Miki Yamamoto
ICCCN1