Performance analysis of finite capacity polling systems with nonexhaustive service
From MaRDI portal
Publication:3796945
DOI10.1016/0166-5316(88)90021-1zbMath0651.90031MaRDI QIDQ3796945
Publication date: 1988
Published in: Performance Evaluation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-5316(88)90021-1
performance analysis; computer simulations; local area networks; polling system; embedded Markov chain; approximate analysis; communication subsystems; finiteness of queue capacities; multiqueue systems with cyclic service; nonexhaustive service model; nonsymmetrical load conditions; polling cycle analysis
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
90B10: Deterministic network models in operations research
Related Items
Unnamed Item, Blocking probability, throughput and waiting time in finite capacity polling systems, Performance analysis of a batch service queue arising out of manufacturing system modelling, Discrete-time approximation of the machine interference problem with generally distributed failure, repair, and walking times