Calculate blocking probability in a two stage network, Computer Engineering

Assignment Help:

In a two stage network there are 512 inlets and outlets, r=s=24. If the probability that a given inlet is active is 0.8, calculate: Blocking probability

Given:

N =M =512,

α =0.8,

r=s=24

Therefore Blocking Probability

PB = (M α (s-1)-((M/r-1)) α)/(rs(s-1))

= (512 x 0.8(23) - (512/24-1)0.8)/( 24 x 24 (23))

= 0.7


Related Discussions:- Calculate blocking probability in a two stage network

Explain characteristics of the artificial neural networks, Question 1: ...

Question 1: Explain in detail the characteristics of the following artificial neural networks. (a) Recurrent Neural Networks. (b) Self-organising Mapping Neural Networks.

Define the term ''turn-around'', The "turn-around" time of a user job is th...

The "turn-around" time of a user job is the? Ans. Total time taken to execute the job is called "turn around" time.

Explain clone process, Explain Clone process. A clone process is genera...

Explain Clone process. A clone process is generated using primitive type clone by duplicating its parent process. However unlike traditional processes it might be share its con

What are benefits and advantages of linq, Benefits and benefits of LINQ are...

Benefits and benefits of LINQ are: 1. Makes it simpler to transform data into objects. 2. A common syntax for all data. 3. Strongly typed code. 4. Provider integration.

Potential of parallelism-parallel computing, Potential of Parallelism P...

Potential of Parallelism Problems in the actual world differ in respect of the degree of natural parallelism inherent in the personal problem domain. Some problems may be simpl

State the various security tools, State the various Security Tools Sec...

State the various Security Tools Securing an Intranet is not a simple task. Just as articles in a house are protected by use of various types of security systems such as lock

Explain with the help of examples fifo algorithms, Explain with the help of...

Explain with the help of examples FIFO algorithms? FIFO policy: This policy easy removes pages in the order they arrived into the main memory. By using this policy we easily

Define dynamic loading, Define dynamic loading. To get better memory-sp...

Define dynamic loading. To get better memory-space utilization dynamic loading is used. With dynamic loading, a routine is not loaded unless it is called. All routines are kept

Learning abilities of perceptrons, Learning Abilities of Perceptrons: ...

Learning Abilities of Perceptrons: Conversely computational learning theory is the study of what concepts particular learning schemes as representation and method detail as a

Push and pop, i want flowchart for push, pop in stack element and display s...

i want flowchart for push, pop in stack element and display stack and exit

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd