Queuing analysis of polling models
From MaRDI portal
Publication:3795210
DOI10.1145/62058.62059zbMath0649.68032WikidataQ56580285 ScholiaQ56580285MaRDI QIDQ3795210
Publication date: 1988
Published in: ACM Computing Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/62058.62059
survey; performance evaluation; computer networks; polling model; cyclic service systems; modeling of token rings
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68N99: Theory of software
Related Items
Some properties of polling systems, Time-dependent analysis of M/G/1 vacation models with exhaustive service, An advanced queueing model to analyze appointment-driven service systems, On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals, Average waiting time of a symmetric polling system under Bernoulli scheduling, Stability of token passing rings, A cyclic-service finite source model with round-robin scheduling, An approximate analysis of a cyclic server queue with limited service and reservations, Mean delay analysis for a message priority-based polling scheme, Blocking probability, throughput and waiting time in finite capacity polling systems, Ergodicity of a polling network, Analysis of a discrete-time queueing system with time-limited service, Analysis of discrete time queues via the reversed process, Workload and waiting time in a fixed-time loop system, Analysis of an asymmetric polling system, Workloads and waiting times in single-server systems with multiple customer classes, The archievable region method in the optimal control of queueing systems; formulations, bounds and policies, Mathematical methods to study the polling systems, Heavy traffic analysis of a single vehicle loop in an automated storage and retrieval system, Unnamed Item
