Asymptotic evaluation of closed queueing networks with many stations

DOI10.1080/15326349208807238MaRDI QIDQ4021159zbMATH OpenOpenAlexFDO

Authors Alexander Birman, Yaakov Kogan

Publication date 17 January 1993

Published in Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15326349208807238

zbMATH Keywords

saddle point methodproduct form networksmultiprocessing system

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• Asymptotic expansion for large closed queuing networks
• Asymptotic expansions for large closed and loss queueing networks
• Asymptotic analysis for closed multichain queueing networks with bottlenecks
• Asymptotic methods for the analysis of closed queueing networks with heavy traffic
• Asymptotic analysis of multiple class queueing networks

Cited in

(14)

• Asymptotic expansion of the stationary probability distribution for states of a closed queueing network with a demand transmission channel
• Asymptotic analysis for closed multichain queueing networks with bottlenecks
• scientific article; zbMATH DE number 4057000 (Why is no real title available?)
• Another approach to asymptotic expansions for large closed queueing networks
• Asymptotic Expansions for a Closed Multiple Access System
• Condensation in large closed Jackson networks
• Asymptotic formulas of network operation time distribution
• Asymptotic analysis of product-form distributions related to large interconnection networks
• Asymptotic expansions for large closed and loss queueing networks
• Asymptotic expansions for closed Markovian networks with state-dependent service rates
• Asymptotic methods for the analysis of closed queueing networks with heavy traffic
• Calculating the normalization constants in queueing networks
• Error bounds for asymptotic approximations of the partition function
• Asymptotic Approximations for a Queueing Network with Multiple Classes

This page was built for publication: Asymptotic evaluation of closed queueing networks with many stations

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