Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Grade of service
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Erlang's lost call assumptions== To calculate the Grade of Service of a specified group of circuits or routes, [[Agner Krarup Erlang]] used a set of assumptions that relied on the network losing calls when all circuits in a group were busy. These assumptions are:<ref name="flood" /> *All traffic through the network is pure-chance traffic, i.e. all call arrivals and terminations are independent random events *There is statistical equilibrium, i.e., the average number of calls does not change *Full availability of the network, i.e., every outlet from a switch is accessible from every inlet *Any call that encounters congestion is immediately lost. From these assumptions Erlang developed the Erlang-B formula which describes the probability of congestion in a circuit group. The probability of congestion gives the Grade of Service experienced.<ref name="flood" />
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)