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

Nikolaos P. Giannakouros

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

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

Computer 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 architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › queueing models
polling systems
0.011991
Waiting-time approximations for service systems with star polling sequence and mixed service strategies · IEEE Trans. Commun. 1991
Performance modeling and evaluation › queueing models
priority queueing
0.011991
Waiting-time approximations for service systems with star polling sequence and mixed service strategies · IEEE Trans. Commun. 1991
Performance modeling and evaluation
queueing models
0.011991
Waiting-time approximations for service systems with star polling sequence and mixed service strategies · IEEE Trans. Commun. 1991

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

conservation-law-based approximation · 0.0
YearPublicationVenuePosition
1991 Waiting-time approximations for service systems with star polling sequence and mixed service strategies
abstract
A conservation-law-based approximation for the mean waiting times in priority service systems with a mixture of exhaustive, gated, one-limited service strategies and star polling sequence is presented. The authors generalize previous results presented by Manfield (1985) for a similar system with one-limited service at the low-priority stations. For service systems with one-limited stations the proposed approximation is a low or medium traffic approximation. However, for systems with a mixture of gated and exhaustive services the approximation is very accurate for the whole range of admissible traffic intensities.>
Nikolaos P. Giannakouros, Auguste Laloux
IEEE Trans. Commun.1