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

Bruce E. Hoiem

dblp:271/7055 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1980
—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 · 50% Wireless networking · 38% Cellular and mobile networks · 12%

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

TopicWeightPapersLastEvidence papers
Wireless networking › scheduling › scheduling policy
preemption policy		 0.011980
Modeling a Voice Network with Preemption · IEEE Trans. Commun. 1980
Network performance modeling
queueing analysis		 0.011980
Modeling a Voice Network with Preemption · IEEE Trans. Commun. 1980
Network performance modeling › teletraffic engineering
grade of service		 0.011980
Modeling a Voice Network with Preemption · IEEE Trans. Commun. 1980
Cellular and mobile networks
telephone network		 0.011980
Modeling a Voice Network with Preemption · IEEE Trans. Commun. 1980

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

queueing analysis · 0.0computer simulation · 0.0
YearPublicationVenuePosition
1980 Modeling a Voice Network with Preemption
abstract
This paper describes the results of a study to calculate the grade of service (GOS) in a telephone network carrying two classes of traffic. When blocked, the higher class calls may preempt calls of the lower class. Two preemption disciplines are considered in this study. They are the ruthless and friendly search preemption disciplines of channels on interswitch trunk groups. The results of a computer model agree very well with a proven network simulator. The CPU time to determine the network GOS was reduced from hours to minutes.
David A. Calabrese, Martin J. Fischer, Bruce E. Hoiem, Eugene P. Kaiser
 IEEE Trans. Commun.3