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

Walter Sotelo

dblp:285/1047 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1988
—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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › queueing models › multiserver queue
m/m/m queue
0.011988
M/M/K systems with M-phase fluctuations of traffic intensity · INFOCOM 1988
Performance modeling and evaluation
queueing models
0.011988
M/M/K systems with M-phase fluctuations of traffic intensity · INFOCOM 1988

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

steady-state analysis · 0.0markov chain · 0.0
YearPublicationVenuePosition
1988 M/M/K systems with M-phase fluctuations of traffic intensity
abstract
The M/sup (m)//M/K and M/sup (m)//M/ infinity models with synchronous fluctuation of traffic intensity are considered. The phase process is assumed to make changes according to an irreducible m-phase Markov chain. In contrast to the model with asynchronous fluctuation of parameters, a phase change may occur only in synchronization with an arrival or beginning of service of a customer. The authors study the steady-state regime of their models and observe that closed-form solutions for the limiting probabilities are generally difficult to obtain. They give a necessary and sufficient condition for the steady state to be attained. Numerical examples are discussed that demonstrate the behavior of the system under different traffic conditions.>
Walter Sotelo, Kaiji Mukumoto, Akira Fukuda
INFOCOM1