Lower bounds for the probability of overload in certain queueing networks

DOI10.2307/3213785MaRDI QIDQ3681695zbMATH OpenOpenAlexFDO

Authors Marek Kanter

Publication date 1985

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3213785

zbMATH Keywords

multidimensional Markov population processesopen queueing networksstochastic order

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• scientific article; zbMATH DE number 3998937
• Overload at the queuing network nodes
• Asymptotics of overflow probabilities in Jackson networks.
• Limit Theorems for Queueing Networks. I
• A note on stochastic bounds for queueing networks

Cited in

(3)

• Overflow and losses in a network queue with a self-similar input
• Estimating the overlapping probability for complex demands in queuing systems
• DEPENDENCE ORDERING FOR QUEUING NETWORKS WITH BREAKDOWN AND REPAIR

This page was built for publication: Lower bounds for the probability of overload in certain queueing networks

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