A generalization of the Erlang formula of traffic engineering

DOI10.1007/BF01161219zbMATH Open0651.60097MaRDI QIDQ1106567FDOQ1106567

Authors: S. H. Smith 

Publication date: 1988

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

Recommendations

• Blocking Probability in a Switching Center With Arbitrary Routing Policy
• Blocking probabilities for large multirate erlang loss systems
• A large deviations approach to the transient of the Erlang loss model
• A generalization of the Erlang's B formula
• Individual blocking probabilities in the loss system \(G_ 1+\cdot \cdot \cdot +G_ N/M/1/0\)

zbMATH Keywords

blocking probabilitytraffic engineeringErlang formulaexponential holding times

Mathematics Subject Classification ID

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

Cites Work

• A Combinatorial Method in the Theory of Queues
• Techniques of asymptotic analysis
• Title not available (Why is that?)
• Blocking Probability in a Switching Center With Arbitrary Routing Policy

Cited In (10)

• Title not available (Why is that?)
• A generalization of the Erlang's B formula
• Blocking Probability in Link-Frame Systems from the Viewpoint of Overflow Processes
• Teletraffic engineering for product-form circuit-switched networks
• Title not available (Why is that?)
• Generalized network transport and Euler-Hille formula
• Blocking Probability in a Switching Center With Arbitrary Routing Policy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Qualitative properties of the Erlang blocking model with heterogeneous user requirements

This page was built for publication: A generalization of the Erlang formula of traffic engineering

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