A pseudoconservation law for service systems with a polling table
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 38 (10) , 1865-1870
- https://doi.org/10.1109/26.61458
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Workloads and waiting times in single-server systems with multiple customer classesQueueing Systems, 1989
- Dynamic priority rules for cyclic-type queuesAdvances in Applied Probability, 1989
- Queuing analysis of polling modelsACM Computing Surveys, 1988
- Waiting times in discrete-time cyclic-service systemsIEEE Transactions on Communications, 1988
- Pseudo-conservation laws in cyclic-service systemsJournal of Applied Probability, 1987
- Polling with a General-Service Order TableIEEE Transactions on Communications, 1987
- Stochastic Decompositions in the M/G/1 Queue with Generalized VacationsOperations Research, 1985
- Analysis of a Priority Polling System for Two-Way TrafficIEEE Transactions on Communications, 1985
- Exact Results for Nonsymmetric Token Ring SystemsIEEE Transactions on Communications, 1985