Queuing analysis of polling models

From MaRDI portal
Revision as of 13:49, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3795210

DOI10.1145/62058.62059zbMath0649.68032OpenAlexW1982217074WikidataQ56580285 ScholiaQ56580285MaRDI QIDQ3795210

Hideaki Takagi

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




Related Items (46)

Ergodicity of a polling networkWAIT-AND-SEE STRATEGIES IN POLLING MODELSAnalysis of a discrete-time queueing system with time-limited serviceAnalysis of discrete time queues via the reversed processHeavy traffic analysis of a single vehicle loop in an automated storage and retrieval systemWorkload and waiting time in a fixed-time loop systemAnalysis of an asymmetric polling systemQueueing models for appointment-driven systemsThe archievable region method in the optimal control of queueing systems; formulations, bounds and policiesA polling model with smart customersOn open problems in polling systemsThe optimal allocation of server time slots over different classes of patientsA mathematical model of transmitting a non-ordinary flow with periodic reservations and block acknowledgements in a channel with correlated noiseOn competitive analysis for polling systemsPolling Models with Unequal Service Rates under Limited Service Policies—Sharp AsymptoticsExploring gate-limited analytical models for high-performance network storage serversA polling-based dynamic order-picking system considering priority ordersTime-dependent analysis of M/G/1 vacation models with exhaustive serviceAnalysis of a discrete-time two-class randomly alternating service model with Bernoulli arrivalsOn a 2-class polling model with reneging and \(k_i\)-limited serviceMathematical methods to study the polling systemsOn pseudo-conservation laws for the cyclic server system with compound Poisson arrivalsFunctional analysis method for the \(M/G/1\) queueing model with single working vacationAverage waiting time of a symmetric polling system under Bernoulli schedulingStability of token passing ringsA cyclic-service finite source model with round-robin schedulingAn approximate analysis of a cyclic server queue with limited service and reservationsDELAYS AT SIGNALIZED INTERSECTIONS WITH EXHAUSTIVE TRAFFIC CONTROLMean delay analysis for a message priority-based polling schemeA polling model with reneging at polling instantsTwo queues with random time-limited pollingMixed gated/exhaustive service in a polling model with prioritiesCross-training workers in Dual Resource Constrained systems with heterogeneous processing timesAnalysis of Markov-modulated fluid polling systems with gated disciplineManaging premium wines using an \((s - 1,s)\) inventory policy: a heuristic solution approachTaxonomy of batch queueing models in manufacturing systemsStability of Polling Networks with State-Dependent Server RoutingOn a general mixed priority queue with server discretionSome properties of polling systemsAn advanced queueing model to analyze appointment-driven service systemsA 2-class maintenance model with dynamic server behaviorWorkloads and waiting times in single-server systems with multiple customer classesThe unobserved waiting customer approximationPerformance ofN machine centers ofK-out-of-M: G type maintained by a single repairmanAsymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover timesBlocking probability, throughput and waiting time in finite capacity polling systems







This page was built for publication: Queuing analysis of polling models