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

Manish R. Parikh

dblp:39/4987 · 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

Systems, architecture and hardware · 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
Network performance modeling · 50% Wireless networking · 25% Internet architecture and protocols · 25%

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

TopicWeightPapersLastEvidence papers
Network performance modeling
local area network performance
0.011992
An Approximate Method for the Performance Analysis of PLAYTHROUGH Rings · IEEE Trans. Computers 1992
Wireless networking
medium access control
0.011992
An Approximate Method for the Performance Analysis of PLAYTHROUGH Rings · IEEE Trans. Computers 1992
Network performance modeling
queueing analysis
0.011992
An Approximate Method for the Performance Analysis of PLAYTHROUGH Rings · IEEE Trans. Computers 1992
Internet architecture and protocols › link-layer protocols
ring network protocols
0.011992
An Approximate Method for the Performance Analysis of PLAYTHROUGH Rings · IEEE Trans. Computers 1992

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

simulation · 0.0queueing system model · 0.0
YearPublicationVenuePosition
1992 An Approximate Method for the Performance Analysis of PLAYTHROUGH Rings
abstract
Analytical models are presented and shown to approximate adequately simulation results for average message queuing time, service time, and control frame round trip time on ring-topology local area networks. These LANs use a PLAYTHROUGH protocol, a data link layer medium access control protocol that achieves concurrent transfer of multiple messages of arbitrary length. The analytical predictions of data message service time and control frame round trip time are used in a queuing system model of average message waiting times versus throughput for this class of multiserver circuit-switched ring under assumptions of uniform and symmetric traffic and a shortest outbound distance first service discipline at each node. The analytical models are validated using simulation results. The analysis includes both the effects of competing traffic originating at other nodes on the ring and the effects of the medium access control mechanism overhead on the waiting times experienced by messages arriving at an arbitrarily chosen node.>
Charles B. Silio Jr., Hatem M. Ghafir, Manish R. Parikh
IEEE Trans. Computers3