On the blocking process in queue networks

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

F. G. Foster, Harry G. Perros

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 conditionsexact boundsapproximate boundsblocking processexponential open queue networksFIFO schedulingfinite intermediate waitingroommean blocking timethree-stage queue networkstwo-stage queue network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items

Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking, Approximate analysis of exponential queueing systems with blocking, On the blocking process in queue networks, A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite graph capacity, 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, Stability of Two-Stage Queues with Blocking, 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, Theory of queuing networks and its applications to the analysis of information-computing systems

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