Performance analysis of finite capacity polling systems with nonexhaustive service

DOI10.1016/0166-5316(88)90021-1zbMath0651.90031OpenAlexW2030633064MaRDI QIDQ3796945

Thomas Raith, Phuoc Tran-Gia

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

zbMATH Keywords

performance analysiscomputer simulationslocal area networkspolling systemembedded Markov chainapproximate analysiscommunication subsystemsfiniteness of queue capacitiesmultiqueue systems with cyclic servicenonexhaustive service modelnonsymmetrical load conditionspolling cycle analysis

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items (4)

Discrete-time approximation of the machine interference problem with generally distributed failure, repair, and walking times ⋮ 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

This page was built for publication: Performance analysis of finite capacity polling systems with nonexhaustive service