Reduction of a polling network to a single node

DOI10.1007/S11134-008-9071-ZzbMath1152.90382OpenAlexW2076106858MaRDI QIDQ943989

Paul Beekhuizen, Dee Denteneer, J. A. C. Resing

Publication date: 12 September 2008

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

Full work available at URL: https://doi.org/10.1007/s11134-008-9071-z

zbMATH Keywords

Concentrating tree networksHoL-based service disciplinesPolling systemsReductions

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (1)

Polling: past, present, and perspective

Cites Work

• Sample-path large deviations for tandem and priority queues with Gaussian inputs
• Mathematical methods to study the polling systems
• Heavy Traffic Analysis of Polling Systems in Tandem
• A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals
• Equivalent Models for Queueing Analysis of Deterministic Service Time Tree Networks
• Communication networks: Message path delays
• An Approximate Time-Delay Analysis for Packet-Switching Communication Networks
• Message Path Delays in Packet-Switching Communication Networks
• A Combinatorial Lemma and Its Application to Concentrating Trees of Discrete-Time Queues
• Reduction Methods for Tandem Queuing Systems
• A Sequence of Service Stations with Arbitrary Input and Regular Service Times

This page was built for publication: Reduction of a polling network to a single node