About: Erlang-B   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

Erlang-B (sometimes also written without the hyphen Erlang B) is a formula derived from the Erlang distribution to describe the probability of call loss on a group of circuits (in a circuit switched network, or equivalent). It is, for example, used in planning telephone networks. The formula was derived by Agner Krarup Erlang and is not limited to telephone networks, since it describes a probability in a queuing system (albeit a special case with a number of servers but no buffer spaces for incoming calls to wait for a free server).

AttributesValues
rdfs:label
  • Erlang-B
rdfs:comment
  • Erlang-B (sometimes also written without the hyphen Erlang B) is a formula derived from the Erlang distribution to describe the probability of call loss on a group of circuits (in a circuit switched network, or equivalent). It is, for example, used in planning telephone networks. The formula was derived by Agner Krarup Erlang and is not limited to telephone networks, since it describes a probability in a queuing system (albeit a special case with a number of servers but no buffer spaces for incoming calls to wait for a free server).
dcterms:subject
dbkwik:freespeech/...iPageUsesTemplate
abstract
  • Erlang-B (sometimes also written without the hyphen Erlang B) is a formula derived from the Erlang distribution to describe the probability of call loss on a group of circuits (in a circuit switched network, or equivalent). It is, for example, used in planning telephone networks. The formula was derived by Agner Krarup Erlang and is not limited to telephone networks, since it describes a probability in a queuing system (albeit a special case with a number of servers but no buffer spaces for incoming calls to wait for a free server). The formula applies under the condition that an unsuccessful call, because the line is busy, is not queued or retried, but instead really lost forever. It is assumed that call attempts arrive following a poisson process. Further it is assumed that call arrivals are independent, and message length (holding times) are exponentially distributed (Markovian system) although the formula turns out to apply under general holding time distributions. The formula provides the GoS (grade of service) which is the probability Pb that a new call arriving at the circuit group is rejected because all servers (circuits) are busy: B(E, m) when E Erlang of traffic are offered to m trunks (communication channels). Erlangs are a dimensionless quantity calculated as the average arrival rate, λ, multiplied by the average call length, T. (see Little's Law) To simplify calculation the formula is often rearranged as it follows: Typically, instead of B(E, m) the inverse 1/B(E, m) is calculated in numerical computation: Function ErlangB (E as Long, m As Integer) As Double Dim InvB As Double Dim j As Integer InvB = 1.0 For j = 1 To m InvB = 1.0 + j / E * InvB Next j ErlangB = 1.0 / InvB End Function
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software