Features of some discrete-time cyclic queueing networks

DOI10.1007/BF01158777zbMath0827.60073MaRDI QIDQ1339086

V. Pereyra

Publication date: 1 December 1994

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

zbMATH Keywords

product formdiscrete-time queuecyclic queueing networkproduct-form invariant distributions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (2)

Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model ⋮ Asymptotic Throughput in Discrete‐Time Cyclic Networks with Queue‐Length‐Dependent Service Rates

Cites Work

• Unnamed Item
• Asymptotic behavior of large discrete-time cyclic queueing networks
• Networks of queues in discrete time
• A discrete-time queueing network
• Technical Note—On Normalizing Constants in Queueing Networks
• The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
• The Cycle Time Distribution of Exponential Cyclic Queues
• Twenty Five Years of Cyclic Queues and Closed Queue Networks: A Review
• On response time and cycle time distributions in a two-stage cyclic queue
• Packet Transmission in a Noisy-Channel Ring Network
• The Time for a Round Trip in a Cycle of Exponential Queues
• Closed Queuing Systems with Exponential Servers
• Computational algorithms for closed queueing networks with exponential servers

This page was built for publication: Features of some discrete-time cyclic queueing networks