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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Shumji Fujii

dblp:96/10710 · DBLP profile ↗
← Back
3ranked-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 · 3

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

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › error control
automatic repeat request		 0.022002
Performance analysis of go-back-N ARQ scheme with selective repeat in intra-block · IEEE Trans. Commun. 2002
Delay performance of a continuous ARQ system with copy-transmissions · INFOCOM 1988
Transport protocols and congestion control › error control › automatic repeat request
go-back-n		 0.022002
Performance analysis of go-back-N ARQ scheme with selective repeat in intra-block · IEEE Trans. Commun. 2002
Delay performance of a continuous ARQ system with copy-transmissions · INFOCOM 1988
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
Network performance modeling
delay analysis		 0.011988
Delay performance of a continuous ARQ system with copy-transmissions · INFOCOM 1988

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

service time analysis · 0.1generating function · 0.0generating functions · 0.0queueing analysis · 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.4
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
 WCNC4
1988 Delay performance of a continuous ARQ system with copy-transmissions
abstract
The characteristics of the transmission delay packets in continuous ARQ (automatic-repeat-request) system, a class of the go-back-N system, are considered. In this ARQ scheme the multiple copies of each packet stored in a buffer, instead of one packet itself, are transmitted to reduce the delay. The generating function of the delay and its average is derived. It is shown that the optimum copy-size minimizing the average delay is given not only by the propagation delay and the packet error rate but also by the traffic intensity.>
Yukuo Hayashida, Shumji Fujii, Yoshikazu Tezuka
 INFOCOM2