Material Detail

Minimum number of channels as a function of the offered traffic in Erlangs for a grade of service (G.O.S.) given with the Erlang-B distribution.

Fig. shows the minimum number of channels required for an offered traffic in Erlangs for a grade of service (G.O.S.) given, using the Erlang-B distribution. Moreover, the minimum number of channels required for a specific value of traffic in Erlangs is calculated and added in the plot using the recursive algorithm due to Dr. Brian Borchers of New Mexico Tech Mathematics Faculty.... Show More

Keywords:: Grade of service, Erlang b, Blocking probability

Disciplines:

Science and Technology / Computer Science / Networking and Communication

Go to Material

Bookmark / Add to Course ePortfolio

Create a Learning Exercise

Add Accessibility Information

Rate

Add a Comment

Quality

User Rating
Comments
Learning Exercises
Bookmark Collections
Course ePortfolios
Accessibility Info

Report Broken Link
Report as Inappropriate

More about this material

Material Type:: Simulation
Date Added to MERLOT:: August 13, 2019
Date Modified in MERLOT:: August 13, 2019
Author:: Juan Ribera Reig Pascual, Universitat Politècnica de València
Submitter:: RIUNET Universitat Politècnica de València
Primary Audience:: High School, College General Ed, College Lower Division, College Upper Division, Graduate School
Technical Format:: Flash, Java Applet, Website

Mobile Compatibility:: Blackberry, iOS (Apple), Windows Mobile, Android
Language:: English
Cost Involved:: No
Source Code Available:: No
Creative Commons:: No

Browse...

Disciplines with similar materials as Minimum number of channels as a function of the offered traffic in Erlangs for a grade of service (G.O.S.) given with the Erlang-B distribution.

Science and Technology / ... / Networking and Communication

People who viewed this also viewed

Other materials like Minimum number of channels as a function of the offered traffic in Erlangs for a grade of service (G.O.S.) given with the Erlang-B distribution.