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

Shrirang Jangi

dblp:120/6612 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1994
—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 architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%
Computer networks
1 paper
Wireless networking · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking
multiple access protocols
0.011994
Performance analysis of reservation random access protocols for wireless access networks · IEEE Trans. Commun. 1994
Performance modeling and evaluation
markov models
0.011994
Performance analysis of reservation random access protocols for wireless access networks · IEEE Trans. Commun. 1994
Performance modeling and evaluation › network performance analysis
protocol performance analysis
0.011994
Performance analysis of reservation random access protocols for wireless access networks · IEEE Trans. Commun. 1994

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

matrix decomposition · 0.0markov chain analysis · 0.0
YearPublicationVenuePosition
1994 Performance analysis of reservation random access protocols for wireless access networks
abstract
A key issue in future wireless access networks is the design of multiaccess protocols that enable dispersed voice and data terminals to efficiently share the terminal-to-base radio channel. A promising class of multiaccess protocols for wireless access is that of reservation random access (RRA) protocols, in which voice talkspurt packets and data packets are statistically multiplexed over TDMA frames. Voice terminals obtain reservations for their talkspurts using a random access protocol. An analysis method for evaluating the performance of a class of RRA protocols is developed. The method is based on a Markovian model, whose stationary solution is obtained via an iterative computational procedure based on matrix decomposition techniques. Subject to a maximum delay constraint, the voice packet dropping rate and distribution of the number of packets dropped from a talkspurt are evaluated for three RRA protocol examples, and comparisons are made with the performance of an ideal hypothetical multiplexer. The transient performance of RRA protocols is evaluated by simulating their response to sudden changes in the number of active voice terminals. Finally, suggestions for the design of integrated voice/data RRA protocols are made.>
Shrirang Jangi, Lazaros F. Merakos
IEEE Trans. Commun.1