On a class of approximations for closed queueing networks
From MaRDI portal
Publication:1115026
DOI10.1007/BF01150857zbMath0664.60089OpenAlexW1967746794MaRDI QIDQ1115026
Publication date: 1989
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01150857
performance measuresqueueing networksshadow pricescapacity allocationfixed point approximationsproduct-form networks
Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items
Utility Optimization in Congested Queueing Networks ⋮ Resource pooling in congested networks: Proportional fairness and product form ⋮ Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling ⋮ Proportional fairness and its relationship with multi-class queueing networks ⋮ Approximate analysis of a Gordon-Newell like non-product-form queueing network
Cites Work