Teletraffic engineering for product-form circuit-switched networks

DOI10.2307/1427463MaRDI QIDQ3201218zbMATH OpenOpenAlexFDO

Authors Keith W. Ross, Danny H. K. Tsang

Publication date 1990

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

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

zbMATH Keywords

Erlang loss systemblocking probabilitiesclosed queueing networksproduct-form solutionequilibrium probabilitiesexponential holding

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Blocking probabilities in large circuit-switched networks
• A generalization of the Erlang formula of traffic engineering
• Loss probabilities in a simple circuit-switched network
• One-dimensional circuit-switched networks
• Computational algorithms for blocking probabilities in circuit-switched networks

Cited in

(7)

• A new perspective on the normalization of invariant measures for loss networks on other product form systems.
• Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward
• Computational complexity of loss networks
• Models of circuit-switching networks with distributed control
• Computation and optimization methods for multiresource queues
• Monte Carlo Summation Applied to Product-Form Loss Networks
• Computational algorithms for blocking probabilities in circuit-switched networks

This page was built for publication: Teletraffic engineering for product-form circuit-switched networks

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