Finite Capacity Queuing Systems with Applications in Computer Modeling

DOI10.1137/0207019MaRDI QIDQ4154065zbMATH OpenOpenAlexFDO

Authors

Publication date 1978

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0207019

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Queueing theory (aspects of probability theory) (60K25)

Cited in

(14)

• Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
• Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking
• Real eigenvalues of certain tridiagonal matrix polynomials, with queueing applications
• On the optimal design of tandem queueing systems with finite buffers
• Sojourn times in a two-stage queueing network with blocking
• Deadlock free buffer allocation in closed queueing networks
• An efficient two-phase approximation method for exponential tandem queueing systems with blocking
• A survey of product form queueing networks with blocking and their equivalences
• A Tandem Queue with Server Slow-Down and Blocking
• An analytic finite capacity queueing network model capturing the propagation of congestion and blocking
• Control of a tandem queue with a startup cost for the second server
• Approximate analysis of exponential queueing systems with blocking
• Marked Markovian arrivals in a tandem G-network with blocking
• Performance analysis of a multiprogramming-multiprocessor retrial queueing system with orderly reattempts

This page was built for publication: Finite Capacity Queuing Systems with Applications in Computer Modeling

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