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

Tatsuhiko Terai

dblp:62/5457 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2002
—ORCID · none

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

Computer networks · 2

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.

Software engineering, system software, and programming languages
1 paper
Operating systems · 100%
Computer networks
1 paper
Transport protocols and congestion control · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › TCP performance enhancement
TCP buffer tuning
0.012001
Scalable Socket Buffer Tuning for High-Performance Web Servers · ICNP 2001
Operating systems
network stack
0.012001
Scalable Socket Buffer Tuning for High-Performance Web Servers · ICNP 2001
Operating systems › network stack
socket buffer management
0.012001
Scalable Socket Buffer Tuning for High-Performance Web Servers · ICNP 2001

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

simulation · 0.1equation-based tuning · 0.1
YearPublicationVenuePosition
2002 A Resource/Connection Management Scheme for HTTP Proxy Servers
Takuya Okamoto, Tatsuhiko Terai, Go Hasegawa, Masayuki Murata 0001
NETWORKING2
2001 Scalable Socket Buffer Tuning for High-Performance Web Servers
abstract
Although many research efforts have been devoted to network congestion in the face of an increase in the Internet traffic, there is little discussion on performance improvements for endhosts. We propose a new architecture, called scalable socket buffer tuning (SSBT), to provide high-performance and fair service for many TCP connections at Internet endhosts. SSBT has two major features. One is to reduce the number of memory accesses at the sender host by using some new system calls, called simple memory-copy reduction (SMR) scheme. The other is equation-based automatic TCP buffer tuning (E-ATBT), where the sender host estimates 'expected' throughput of the TCP connections through a simple mathematical equation, and assigns a send socket buffer to them according to the estimated throughput. If the socket buffer is short, the max-min fairness policy is used. We confirm the effectiveness of our proposed algorithm through both a simulation technique and an experimental system. From the experimental results, we have found that our SSBT can achieve up to a 30% gain for Web server throughput, and a fair and effective usage of the sender socket buffer can be achieved.
Go Hasegawa, Tatsuhiko Terai, Takuya Okamoto, Masayuki Murata 0001
ICNP2