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

Takuto Kubo

dblp:428/3166 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0004-0870-0690ORCID · corroborated

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

Computer networks · 1 · 1 first-author · 1 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 architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 100%
Computer networks
1 paper
Optical networks · 100%

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

TopicWeightPapersLastEvidence papers
Optical networks › optical switching
optical circuit switching
1.012026
Design of Three-Stage Twisted and Folded Clos Network Based on Necessary and Sufficient Condition for Strict-Sense Non-Blocking · IEEE Trans. Netw. 2026
Interconnection networks and networks-on-chip › switching network
nonblocking condition
1.012026
Design of Three-Stage Twisted and Folded Clos Network Based on Necessary and Sufficient Condition for Strict-Sense Non-Blocking · IEEE Trans. Netw. 2026
Interconnection networks and networks-on-chip
switching network
1.012026
Design of Three-Stage Twisted and Folded Clos Network Based on Necessary and Sufficient Condition for Strict-Sense Non-Blocking · IEEE Trans. Netw. 2026

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

optimization · 2.0integer programming · 2.0
YearPublicationVenuePosition
2026 Mitigating Delay Impact of Bursty Cross Traffic in Combined Input and Output Queued Switches Using Virtual Input Queuing
Takuto Kubo, Shingo Okada, Eiji Oki
HPSR1
2026 Design of Three-Stage Twisted and Folded Clos Network Based on Necessary and Sufficient Condition for Strict-Sense Non-Blocking
abstract
Optical circuit switching provides high-capacity and low-latency data transmission capabilities. A Clos network is well known as a class of non-blocking switching networks. A prior study addressed designing a three-stage twisted and folded Clos network (3TF), which has a larger switching network size, i.e., the number of terminals connected to the network, than its two-stage variants. That study used a sufficient condition for strict-sense non-blocking (SNB) in 3TF to solve an optimization design problem. However, this condition may be stricter than necessary to guarantee strict-sense non-blocking, suggesting that by using the necessary and sufficient condition, the constraints can likely be relaxed, allowing for configurations with a larger switching network size. No study has addressed the necessary and sufficient condition for SNB in the whole 3TF. A past study derived the SNB condition for the three-stage folded Clos (3F), the basis of 3TF, assuming that connections within the same first- and second-stage group loop back no further than the second stage. Its necessary and sufficient condition in the general case, however, remains unexamined, despite an initial study on the SNB condition for 3F. This paper proposes a design model of 3TF based on the necessary and sufficient condition for strict-sense non-blocking. We derive and prove the necessary and sufficient condition for strict-sense non-blocking in the whole 3TF. The proposed design model considers two cases: one where no blocking is allowed and another where the blocking probability does not exceed a given admissible threshold, based on our derived necessary and sufficient condition for strict-sense non-blocking in 3TF. We formulate the problem based on the necessary and sufficient condition to obtain the configuration of the proposed model that maximizes the switching network size. We theoretically show that the maximum switching network size obtained by solving the proposed model is always larger than or equal to that obtained by solving the existing 3TF design model. Numerical results show that the proposed model achieves a larger switching network size than the existing 3TF design model.
Takuto Kubo, Ryotaro Taniguchi, Kazuya Anazawa, Eiji Oki
IEEE Trans. Netw.1