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

Guy Scheys

dblp:32/2064 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1991
—ORCID · none

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

Computer networks · 2

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 · 67% Storage systems · 33%

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

TopicWeightPapersLastEvidence papers
Storage systems › buffer management
buffer allocation
0.011991
Minimization of the total loss rate for two finite queues in series · IEEE Trans. Commun. 1991
Performance modeling and evaluation
queueing models
0.011991
Minimization of the total loss rate for two finite queues in series · IEEE Trans. Commun. 1991
Performance modeling and evaluation › queueing models
queueing network model
0.011991
Minimization of the total loss rate for two finite queues in series · IEEE Trans. Commun. 1991

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

numerical optimization · 0.0erlang service time · 0.0
YearPublicationVenuePosition
1991 Minimization of the total loss rate for two finite queues in series
abstract
Two finite-capacity loss queues in series, with Poisson arrival at the first queue and with Erlang service time distribution at both queues are considered. It is assumed that the service rate at the second queue is held fixed and that a maximum buffer space is globally available. For this model, the problem of optimally choosing the service rate at the first queue and the buffer space distribution over the two queues is considered in order to minimize the steady-state total network loss rate. It is shown that a decrease of the service rate at the first queue can reduce the total network loss rate only if this lower service rate decreases the variability of the process feeding the second queue. Numerical results show that, when optimal values are assigned to the parameters of the model, a significant reduction of the network loss rate can be achieved, especially when the network load is moderate and when the service time distributions have a small variance.>
Pierre-Jacques Courtois, Guy Scheys
IEEE Trans. Commun.2
1990 Minimizing the Loss of Non-Blocking Tandem Buffer Stages
Pierre-Jacques Courtois, Guy Scheys
Comput. Networks ISDN Syst.2