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

P. J. Burke

dblp:179/8726 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1976
—ORCID · none

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

Computer networks · 2 · 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
2 papers
Performance modeling and evaluation · 100%
Computer networks
1 paper
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
queueing models
0.021976
Behavior of Tandem Buffers with Geometric Input and Markovian Output · IEEE Trans. Commun. 1976
Proof of a Conjecture on the Interarrival-Time Distribution in an M/M/1 Queue with Feedback · IEEE Trans. Commun. 1976
Performance modeling and evaluation › queueing models › queueing network model
discrete-time queueing network
0.011976
Behavior of Tandem Buffers with Geometric Input and Markovian Output · IEEE Trans. Commun. 1976
Internet architecture and protocols
buffer management
0.011976
Behavior of Tandem Buffers with Geometric Input and Markovian Output · IEEE Trans. Commun. 1976

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

markov chain analysis · 0.0equilibrium analysis · 0.0
YearPublicationVenuePosition
1976 Proof of a Conjecture on the Interarrival-Time Distribution in an M/M/1 Queue with Feedback
abstract
In a Jackson-type queuing network with feedback, the equilibrium state distribution of each queue is that of anM/M/ssystem. In support of a previous conjecture that nevertheless the input processes in such a network are not Poisson, the marginal interarrival-time distribution for an equilibriumM/M/1queuing system with feedback, counting both fed-back and exogenous customers as arrivals, is calculated. Since this distribution is a mixture of two exponentials, the total input to such a system is not Poisson.
P. J. Burke
IEEE Trans. Commun.1
1976 Behavior of Tandem Buffers with Geometric Input and Markovian Output
abstract
A discrete-time system of infinite-capacity buffers in tandem is studied. The input process to the first buffer consists of individual arrivals characterized by a geometric distribution of the time between arrivals; and the probability that the output channel of each buffer, except the last, is transmitting at any epoch depends only on the number of digits in the buffer at that epoch. The transmitting state of the last buffer may depend more generally on the history of that buffer. The analysis shows that in equilibrium, the input processes to the subsequent buffers in the system are geometric with the same parameter as the input process to the first buffer. Therefore, each buffer in the system can be analyzed separately. Furthermore, the equilibrium state probabilities for a given buffer at a given epoch are independent of those for any other buffer in the system at the same epoch.
J. Hsu, P. J. Burke
IEEE Trans. Commun.2