Mean waiting time approximations in cyclic-service systems with exhaustive limited service policy

DOI10.1016/0166-5316(92)90082-RzbMath0743.68042OpenAlexW2011871527MaRDI QIDQ3991753

Kow C. Chang, Deniz Sandhu

Publication date: 28 June 1992

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(92)90082-r

zbMATH Keywords

polling systemsmean waiting timescyclic-service systemlimited service policytoken-passing network protocols

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Polling: past, present, and perspective ⋮ Iterative approximation of \(k\)-limited polling systems ⋮ An approximate analysis of a cyclic server queue with limited service and reservations ⋮ Stability conditions for a pipeline polling scheme in satellite communications

This page was built for publication: Mean waiting time approximations in cyclic-service systems with exhaustive limited service policy