Reduction of a polling network to a single node
From MaRDI portal
Publication:943989
DOI10.1007/S11134-008-9071-ZzbMATH Open1152.90382OpenAlexW2076106858MaRDI QIDQ943989FDOQ943989
Authors: Paul Beekhuizen, Dee Denteneer, Jacques 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
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
- Heavy traffic analysis of polling systems in tandem
- Reduction Methods for Tandem Queuing Systems
- Mathematical methods to study the polling systems
- A Sequence of Service Stations with Arbitrary Input and Regular Service Times
- Equivalent Models for Queueing Analysis of Deterministic Service Time Tree Networks
- Sample-path large deviations for tandem and priority queues with Gaussian inputs
- A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals
- 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
Cited In (1)
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)
