A note on cycle times in tree-like queueing networks

DOI10.2307/1427233MaRDI QIDQ3314711zbMATH OpenOpenAlexFDO

Authors Peter G. Harrison

Publication date 1984

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1427233

zbMATH Keywords

tree-like networkscycle time distributionclosed networks of queues

Mathematics Subject Classification ID

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

Recommendations

• Cycle times in single server cyclic Jackson networks.
• scientific article; zbMATH DE number 3905605
• Treelike queueing networks: Asymptotic stationarity and heavy traffic
• Cycle time distribution of cyclic networks with blocking
• The cyclic queue and the tandem queue

Cited in

(9)

• Analytical method for determining the characteristics of stochastic networks with different classes of messages
• Determining the exit time distribution for a closed cyclic network
• An invariance property of sojourn times in cyclic networks
• scientific article; zbMATH DE number 3908131 (Why is no real title available?)
• The cycle-time distribution in a central server network with state-dependent branching
• Features of some discrete-time cyclic queueing networks
• scientific article; zbMATH DE number 3843466 (Why is no real title available?)
• Cycle Times in Two-Stage Closed Queueing Networks: Applications to Multiprogrammed Computer Systems with Virtual Memory
• Cycle times in single server cyclic Jackson networks.

This page was built for publication: A note on cycle times in tree-like queueing networks

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