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
Demo Data from VLDB 2026 / reviewers in the wild / expert

J. N. Holyoak

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

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

Computer networks · 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 · 44% Network optimization and economics · 44% Transport protocols and congestion control · 13%

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

TopicWeightPapersLastEvidence papers
Network performance modeling
queueing network model		 0.011977
On the Maximum Average Throughput Rate for a Tandem Node Network · IEEE Trans. Commun. 1977
Network optimization and economics
throughput maximization		 0.011977
On the Maximum Average Throughput Rate for a Tandem Node Network · IEEE Trans. Commun. 1977
Transport protocols and congestion control › rate control
input rate regulation		 0.011977
On the Maximum Average Throughput Rate for a Tandem Node Network · IEEE Trans. Commun. 1977

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

policy iteration · 0.0markov decision theory · 0.0
YearPublicationVenuePosition
1977 On the Maximum Average Throughput Rate for a Tandem Node Network
abstract
The problem of regulating inputs into a tandem store-and-forward node pair with finite queue limits in order to maximize the average message completion rate is considered from the viewpoint of Markov Decision Theory. A variation of the policy iteration procedure due to Howard [3] is used to compute optimum control policies and message completion rates for various configurations of system parameters. Comparative data are provided on the performance of the optimum control law relative to simpler local control laws which require no information sharing.
Stephen K. Jones, Ralph K. Cavin III, J. N. Holyoak
 IEEE Trans. Commun.3