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

Nobuyuki Sugimachi

dblp:97/5422 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2002
—ORCID · none

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

Computer networks · 3 · 1 first-author

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
Transport protocols and congestion control · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › error control
automatic repeat request
0.012002
Performance analysis of go-back-N ARQ scheme with selective repeat in intra-block · IEEE Trans. Commun. 2002
Transport protocols and congestion control › error control › automatic repeat request
go-back-n
0.012002
Performance analysis of go-back-N ARQ scheme with selective repeat in intra-block · IEEE Trans. Commun. 2002
Transport protocols and congestion control › error control › automatic repeat request
selective repeat ARQ
0.012002
Performance analysis of go-back-N ARQ scheme with selective repeat in intra-block · IEEE Trans. Commun. 2002

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

service time analysis · 0.1generating functions · 0.0generating function · 0.0
YearPublicationVenuePosition
2002 Performance analysis of go-back-N ARQ scheme with selective repeat in intra-block
abstract
The performances of the go-back-N ARQ scheme with selective repeat in intra-block (GBN-SR) and revised GBN-SR (Rev-GBN-SR) schemes are analyzed. Using the derived generating function of the service time of a packet, the throughputs of the proposed schemes are compared with that of Benelli's (1986) scheme. It is shown that the proposed Rev-GBN-SR scheme shows good performance in a wider range from low to high packet error rate regions.
Yukuo Hayashida, Akiko Maeda, Nobuyuki Sugimachi, Shumji Fujii
IEEE Trans. Commun.3
1999 Throughput analysis of go-back-N ARQ scheme with selective repeat in intra-block
abstract
In this paper, we determine an exact formula for the throughput performance of the GBN SR scheme, in which the go-back-N ARQ scheme is used for inter-block transmission and the selective repeat scheme is used for intra-block transmission. Using that formula, the throughput performance of GBN SR scheme is compared with that of Benelli's (1986, 1993) scheme in a numerical manner. As a result, it is shown that the throughput performance of the GBN SR scheme is superior to that of Benelli's scheme in a wider range of packet error rate from low to medium, but is inferior at high packet error rates.
Nobuyuki Sugimachi, Akiko Maeda, Yukuo Hayashida, Shumji Fujii
WCNC1
1995 Multi-segment bandwidth reservation protocol for DQDB subnetwork
abstract
The DQDB MAC Protocol standardized by the IEEE 802.6 Committee is the single segment bandwidth reservation scheme that reserves the bandwidth for only one segment in the distributed queue. Recently, the multi-segment bandwidth reservation schemes that reserve the bandwidth for not only one segment in the distributed queue but also a part of or all segments in the local node queue have been proposed. In this paper, we propose a new multi-segment bandwidth reservation protocol that can quickly react to changes of node's traffic and can quickly allocate bandwidth fairly and waste-free. We also evaluate the mean message transmission delay and the throughput convergence performance by simulation. As a result, the mean message transmission delay can be decreased and the throughput can be quickly converged to the fair bandwidth allocation.
Yukuo Hayashida, Manabu Ikegami, Nobuyuki Sugimachi
LCN3