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.
Original language | English |
---|---|
Pages (from-to) | 164-170 |
Journal | IEEE Transactions on Communications |
Volume | 36 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1988 |