Waiting times in discrete-time cyclic-service systems
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 36 (2) , 164-170
- https://doi.org/10.1109/26.2746
Abstract
Single-served, multiqueue systems with cyclic service in discrete time are considered. Nonzero switchover times between consecutive queues are assumed; the service strategies at the various queues may differ. A decomposition for the amount of work in such systems is obtained, leading to an exact expression for a weighted sum of the mean waiting times at the various queues. >Keywords
This publication has 9 references indexed in Scilit:
- A Queue with Starter and a Queue with Vacations: Delay Analysis by DecompositionOperations Research, 1986
- Waiting-time approximations for cyclic-service systems with switch-over timesACM SIGMETRICS Performance Evaluation Review, 1986
- Stochastic Decompositions in the M/G/1 Queue with Generalized VacationsOperations Research, 1985
- Exact Results for Nonsymmetric Token Ring SystemsIEEE Transactions on Communications, 1985
- Message Delay Analysis for Polling and Token Multiple-Access Schemes for Local Communication NetworksIEEE Journal on Selected Areas in Communications, 1983
- Poisson Arrivals See Time AveragesOperations Research, 1982
- Polling in a Loop SystemJournal of the ACM, 1980
- Queueing Models for Computer Communications System AnalysisIEEE Transactions on Communications, 1977
- Waiting Lines and Times in a System with PollingJournal of the ACM, 1974