Material Detail

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

Fig. shows the maximum offered traffic in Erlangs as a function of the number of channels for a grade of service (G.O.S.) given with the Erlang-B distribution. Moreover, the maximum offered traffic in Erlangs for a specific number of channels is calculated and added in the plot .

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
Accessibility Information Available:: No
Creative Commons:: No

Browse...

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

Science and Technology / ... / Networking and Communication

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