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

Byung C. Shin

dblp:122/6608 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

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

Computer 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
Transport protocols and congestion control · 61% Network performance modeling · 30% Physical-layer communications · 9%

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.011992
A selective-repeat-ARQ protocol for parallel channels and its resequencing analysis · IEEE Trans. Commun. 1992
Network performance modeling
queueing analysis
0.011992
A selective-repeat-ARQ protocol for parallel channels and its resequencing analysis · IEEE Trans. Commun. 1992
Transport protocols and congestion control › error control › automatic repeat request
selective repeat ARQ
0.011992
A selective-repeat-ARQ protocol for parallel channels and its resequencing analysis · IEEE Trans. Commun. 1992
Physical-layer communications › channel modeling › information-theoretic channel modeling
parallel channels
0.011992
A selective-repeat-ARQ protocol for parallel channels and its resequencing analysis · IEEE Trans. Commun. 1992

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

generating function analysis · 0.0dynamic channel assignment · 0.0
YearPublicationVenuePosition
1992 A selective-repeat-ARQ protocol for parallel channels and its resequencing analysis
abstract
A communications system in which multiple parallel channels are available to carry traffic from a transmitter to a receiver is considered, and an extension of the selective-repeat automatic repeat request (SR-ARQ) protocol that dynamically assigns packets to channels for each (re)transmission is presented. Because of selective retransmission, packets arrive at the receiver out of order and must be stored in a resequencing buffer. A queuing model for the resequencing buffer is constructed. The generating function of the buffer occupancy and the packet-delay distribution are derived, and procedures for simplifying the computation are presented. The dynamic assignment scheme is compared with, and shown to have performance superior to, a static assignment scheme.>
Nachum Shacham, Byung C. Shin
IEEE Trans. Commun.2