scientific article; zbMATH DE number 934471

MaRDI QIDQ4895168zbMATH OpenFDO

Authors P. R. Kumar

Publication date 3 March 1997

zbMATH Keywords

closed irreducible networkmaximal throughput capacitypole multiplicity in heavy traffic

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• New linear program performance bounds for closed queueing networks
• Simple bounds for closed queueing networks
• Throughput bounds for closed queueing networks
• scientific article; zbMATH DE number 1060034
• The Delay of Open Markovian Queueing Networks: Uniform Functional Bounds, Heavy Traffic Pole Multiplicities, and Stability

Cited in

(10)

• Simple bounds for closed queueing networks
• Asymptotic analysis for closed multiclass queueing networks in critical usage
• Strong approximations for multiclass feedforward queueing networks.
• scientific article; zbMATH DE number 610378 (Why is no real title available?)
• The Delay of Open Markovian Queueing Networks: Uniform Functional Bounds, Heavy Traffic Pole Multiplicities, and Stability
• On the asymptotic behaviour of closed multiclass queueing networks
• A unifying framework for the approximate solution of closed multiclass queuing networks
• Stochastic Monotonicity of Markovian Multiclass Queueing Networks
• Asymptotic expansions for large closed queueing networks with multiple job classes
• A multiclass feedback queueing network with a regular Skorokhod problem

This page was built for publication:

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