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

Muralidhar M. Balagangadhar

dblp:271/8794 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1979
—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
Wireless networking · 50% Vehicular, aerial and satellite networks · 25% Physical-layer communications · 25%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
multiple access
0.011979
Analysis of a Reservation Multiple Access Technique for Data Transmission Via Satellites · IEEE Trans. Commun. 1979
Wireless networking › medium access control › reservation MAC
packet reservation multiple access
0.011979
Analysis of a Reservation Multiple Access Technique for Data Transmission Via Satellites · IEEE Trans. Commun. 1979
Vehicular, aerial and satellite networks
satellite communication
0.011979
Analysis of a Reservation Multiple Access Technique for Data Transmission Via Satellites · IEEE Trans. Commun. 1979
Wireless networking › medium access control
TDMA
0.011979
Analysis of a Reservation Multiple Access Technique for Data Transmission Via Satellites · IEEE Trans. Commun. 1979

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

simulation · 0.0queueing analysis · 0.0
YearPublicationVenuePosition
1979 Analysis of a Reservation Multiple Access Technique for Data Transmission Via Satellites
abstract
A new reservation-based time-division multiple access scheme is proposed. This scheme is analyzed as a cyclic-multiqueue attended by a single server, with attention being focused on an imbedded process obtained by examining the system at special epochs located at the beginnings of each cycle. The resulting functional equation is solved by simplification using an independence assumption. The mean and standard deviation of queue sizes (at the epochs) and cycle times thus obtained are verified, for the special case of Poisson arrivals, using a GPSS-V simulation model.
Muralidhar M. Balagangadhar, Raymond L. Pickholtz
IEEE Trans. Commun.1