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

Bart Sanders

dblp:23/5653 · DBLP profile ↗
← Back
2ranked-venue papers
1as 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 · 1Computer networks · 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 networks
1 paper
Network performance modeling · 100%

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

TopicWeightPapersLastEvidence papers
Network performance modeling › loss systems
blocking probability computation		 0.011980
Comments on "Calculation of Some Functions Arising in Problems of Queueing and Communications Traffic" · IEEE Trans. Commun. 1980
Network performance modeling
queueing analysis		 0.011980
Comments on "Calculation of Some Functions Arising in Problems of Queueing and Communications Traffic" · IEEE Trans. Commun. 1980
Network performance modeling › teletraffic engineering
teletraffic analysis		 0.011980
Comments on "Calculation of Some Functions Arising in Problems of Queueing and Communications Traffic" · IEEE Trans. Commun. 1980

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

monotonic property of overflow traffic · 0.0
YearPublicationVenuePosition
1992 The Calculation of Overflow Moments in Loss Systems with Selective Trunk Reservation
J. F. E. Wallin, Bart Sanders
 Perform. Evaluation2
1980 Comments on "Calculation of Some Functions Arising in Problems of Queueing and Communications Traffic"
abstract
In this brief correspondence it is argued that Rappaport's formulas which were developed to calculate the inverse of blocking probability for Erlang loss and Erlang delay systems should be revised. These formulas can readily be solved by taking advantage of the monotonic property of overflow traffic as suggested earlier in the literature.
Bart Sanders
 IEEE Trans. Commun.1