Reduction of a polling network to a single node

DOI10.1007/S11134-008-9071-ZMaRDI QIDQ943989zbMATH OpenOpenAlexFDO

Authors Paul Beekhuizen, Dee Denteneer, Jacques Resing

Publication date 12 September 2008

Published in Queueing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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)

Recommendations

• A simple analysis of average queueing delay in tree networks
• Polling systems with periodic server routeing in heavy traffic: distribution of the delay
• Equivalent Models for Queueing Analysis of Deterministic Service Time Tree Networks
• scientific article; zbMATH DE number 932438
• A discrete model of a large polling system

Cites work

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

Cited in

(1)

• Polling: past, present, and perspective

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943989)