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

S. R. Chandran

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

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

Computer networks · 1 · 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 · 77% Vehicular, aerial and satellite networks · 23%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › error control
automatic repeat request
0.011986
A selective repeat ARQ scheme for point-to-multipoint communications and its throughput analysis · SIGCOMM 1986
Vehicular, aerial and satellite networks › satellite communication
satellite broadcasting
0.011986
A selective repeat ARQ scheme for point-to-multipoint communications and its throughput analysis · SIGCOMM 1986

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

throughput analysis · 0.0simulation · 0.0
YearPublicationVenuePosition
1986 A selective repeat ARQ scheme for point-to-multipoint communications and its throughput analysis
abstract
Selective repeat automatic-repeat-request (ARQ) schemes with finite receiver buffer have been studied and analyzed extensively for point-to-point communications. In this paper, we propose a selective repeat ARQ scheme for point-to-multipoint communications where each receiver has a finite buffer size. A lower bound on the throughput efficiency of the proposed scheme is obtained. Computation of the lower bound and simulation of the scheme reveal that the ARQ scheme performs quite satisfactorily, particularly for channels with large round-trip delay and high data rate like the satellite channel. The proposed scheme outperforms the full-memory go-back-N scheme proposed by Gopal, et al. [13]. The scheme seems ideally suited for the case of a satellite operating in broadcast mode with many receivers.
S. R. Chandran
SIGCOMM1