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 EDBT 2026 / reviewers in the wild / expert

Paul Caseau

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

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

Software engineering, systems software and programming languages · 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%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
queueing models		 0.011979
Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room · IEEE Trans. Software Eng. 1979
Performance modeling and evaluation › network performance analysis
network protocol performance		 0.011979
Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room · IEEE Trans. Software Eng. 1979

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

tandem queue analysis · 0.0queueing approximation · 0.0
YearPublicationVenuePosition
1979 Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room
abstract
A tandem queueing system with blocking due to finite waiting room is considered. Maximum throughput is studied by an approximation for several cases. The service time can depend on the number of customers; intermediate arrivals can also be allowed. Some special models with two stations in sequence and blocking are examined. These models are used for the performance evaluation of computer systems. In particular, the maximum throughput for a virtual memory operating system and for a node-to-node protocol in a computer network are obtained.
Paul Caseau, Guy Pujolle
 IEEE Trans. Software Eng.1