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

Takahiro Matsuo

dblp:11/6138 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2000
0000-0001-9389-0628ORCID · corroborated

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

Systems, architecture and hardware · 1Computer networks · 1

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
1 paper
Internet architecture and protocols · 50% Transport protocols and congestion control · 44% Routing and switching · 6%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › packet scheduling
fair queueing
0.012000
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet · INFOCOM 2000
Internet architecture and protocols
packet scheduling
0.012000
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet · INFOCOM 2000
Transport protocols and congestion control
TCP congestion control
0.012000
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet · INFOCOM 2000
Transport protocols and congestion control › TCP
TCP fairness
0.012000
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet · INFOCOM 2000
Routing and switching › switch scheduling
deficit round-robin
0.012000
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet · INFOCOM 2000
Internet architecture and protocols › packet scheduling
router scheduling
0.012000
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet · INFOCOM 2000

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

simulation · 0.0analysis · 0.0
YearPublicationVenuePosition
2000 Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
abstract
We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be provided for elastic applications sharing the link. Packet scheduling algorithms that we consider are FIFO (first in first out), RED (random early detection), and DRR (deficit round robin). Through simulation and analysis results, we discuss the degree of achieved fairness in those scheduling algorithms. Furthermore, we propose a new algorithm which combines RED and DRR algorithms in order to prevent the unfairness property of the original DRR algorithm, which appears in some circumstances where we want to resolve the scalability problem of the DRR algorithm. In addition to the TCP Reno version, we consider TCP Vegas to investigate its capability of providing fairness. The results show that the principle of TCP Vegas conforms to DRR, but it cannot help improving the fairness among connections in FIFO and RED cases, which seems to be a substantial obstacle for the deployment of TCP Vegas.
Go Hasegawa, Takahiro Matsuo, Masayuki Murata 0001, Hideo Miyahara
INFOCOM2
1993 A Built-in Self- Test for ADC and DAC in a Single-Chip Speech CODEC
abstract
Built-in self-test (BIST) has been applied to test an analog to digital converter (ADC) and a digital to analog converter (DAC) embedded in a DSP-core ASIC. The performance characteristics of the ADC and the DAC designed in according with the CCITT recommendations are measured using BIST. Three characteristics have been evaluated and the measured results have shown good agreement with measured results by conventional tests. In the BIST operation, the DSP-core generates input stimulus and analyzes output response. Therefore, test-time is reduced, analog or mixed-signal test equipment is not needed, and finally, test-cost is reduced compared with conventional test methods. This paper describes the BIST design and evaluational results.>
Eiichi Teraoka, Toru Kengaku, Ikuo Yasui, Kazuyuki Ishikawa, Takahiro Matsuo, Hideyuki Wakada, Narumi Sakashita, Yukihiko Shimazu, Takeshi Tokuda
ITC5