Reduction of a polling network to a single node
From MaRDI portal
Publication:943989
DOI10.1007/s11134-008-9071-zzbMath1152.90382MaRDI QIDQ943989
J. A. C. Resing, Dee Denteneer, Paul Beekhuizen
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
90B22: Queues and service in operations research
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