Iterative approximation of \(k\)-limited polling systems

DOI10.1007/s11134-007-9010-4zbMath1122.60083OpenAlexW2117376138MaRDI QIDQ885544

Marcel Van Vuuren, Erik M. M. Winands

Publication date: 14 June 2007

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-007-9010-4

zbMATH Keywords

decompositionapproximationpolling systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (12)

A duplex cyclic polling system for mixed queues ⋮ On competitive analysis for polling systems ⋮ Branching-type polling systems with large setups ⋮ SERVER WAITING TIMES IN INFINITE SUPPLY POLLING SYSTEMS WITH PREPARATION TIMES ⋮ The stochastic economic lot scheduling problem: a survey ⋮ Exploring gate-limited analytical models for high-performance network storage servers ⋮ Analysis of tandem polling queues with finite buffers ⋮ On a 2-class polling model with reneging and \(k_i\)-limited service ⋮ Analysis of the scheduling mechanism for virtualization of links with partial isolation ⋮ Time-limited polling systems with batch arrivals and~phase-type service times ⋮ Traffic Management Heuristics for Bidirectional Segments on Double-Track Railway Lines ⋮ A STATE-DEPENDENT POLLING MODEL WITH k-LIMITED SERVICE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mean value analysis for polling systems
• Queueing systems with vacations - a survey
• An approximate analysis of a cyclic server queue with limited service and reservations
• Pseudo-conservation laws in cyclic-service systems with a class of limited service policies
• A continuous polling system with general service times
• Monotonicity and stability of periodic polling models
• Approximating queue size and waiting time distributions in general polling systems
• Workloads and waiting times in single-server systems with multiple customer classes
• A decomposition method for analyzing inhomogeneous assembly/disassembly systems
• Polling systems and multitype branching processes
• Performance analysis of multi-server tandem queues with finite buffers and blocking
• The distributional form of Little's law and the Fuhrmann-Cooper decomposition
• Determining Production Schedules Under Base-Stock Policies in Single Facility Multi-Item Production Systems
• Approximate analysis of transfer lines with unreliable machines and finite buffers
• Mean waiting time approximations in cyclic-service systems with exhaustive limited service policy
• An empirical study of queueing approximations based on phase-type distributions
• The Stochastic Economic Lot Scheduling Problem: Cyclical Base-Stock Policies with Idle Times
• A two-queue model with exhaustive and limited service disciplines
• Marked point processes as limits of Markovian arrival streams

This page was built for publication: Iterative approximation of \(k\)-limited polling systems