On a class of approximations for closed queueing networks

DOI10.1007/BF01150857zbMath0664.60089OpenAlexW1967746794MaRDI QIDQ1115026

F. P. Kelly

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1007/bf01150857

zbMATH Keywords

performance measuresqueueing networksshadow pricescapacity allocationfixed point approximationsproduct-form networks

Mathematics Subject Classification ID

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

• Unnamed Item
• Unnamed Item
• Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
• Open and Closed Models for Networks of Queues
• A Minimum Delay Routing Algorithm Using Distributed Computation
• Routing and Capacity Allocation in Networks with Trunk Reservation