On the blocking process in queue networks

DOI10.1016/0377-2217(80)90060-0zbMath0444.90036MaRDI QIDQ1145054

Harry G. Perros, F. G. Foster

Publication date: 1980

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(80)90060-0

zbMATH Keywords

stability conditions; exact bounds; approximate bounds; blocking process; exponential open queue networks; FIFO scheduling; finite intermediate waitingroom; mean blocking time; three-stage queue networks; two-stage queue network

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

90B10: Deterministic network models in operations research

Related Items

A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite graph capacity, Theory of queuing networks and its applications to the analysis of information-computing systems, Approximate analysis of exponential queueing systems with blocking, On the blocking process in queue networks, Approximate analysis of exponential tandem queues with blocking, Closed-form expected queueing times of a tandem system with finite intermediate buffer: A recursive approach, Performance analysis of a queueing system with facilities requiring post- processing, Modelling a disc I/0 system, Approximate decomposition for closed queueing network models of FMSs with a block-and wait and state-dependent routing mechanism, Modeling the blocking phenomenon of service facilities, Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking

Cites Work

• Unnamed Item
• On the blocking process in queue networks
• Modelling a disc I/0 system
• A Queueing Model with Finite Waiting Room and Blocking
• Hierarchical Queue Networks with Partially Shared Servicing
• Networks of Waiting Lines
• Two queues in series with a finite, intermediate waitingroom
• Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
• A Sequence of Two Servers with No Intermediate Queue