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

What is refactoring, What is refactoring? Refactoring is explained as t...

What is refactoring? Refactoring is explained as the changes to the internal structure of software to improve its design without changing its external functionality. It is an e

Reprographic technologies, Reprography: Reprography, as a term, has ga...

Reprography: Reprography, as a term, has gained international recognition in 1963. It includes "photocopying , microcopying, duplicating and in-plant printing and is character

Convert the octal number 7401 to binary, Convert the octal number 7401 to B...

Convert the octal number 7401 to Binary. Ans. Octal number 7401 to Binary conversion: Every octal digit represents 3 binary digits. To change an octal number to binary number,

#title.un ba lance out put differential amplitude, #questi on.. How it wor...

#questi on.. How it works explain

Perform subtraction in base 5 using r and r-1 complement, Q Write a menu dr...

Q Write a menu driven program to perform subtraction in base 5 using r and (r-1) complement with necessary validations.

Why we need to construct state transition diagram, Why we need to construct...

Why we need to construct state transition diagram Basically you need to construct a state transition diagram for each object with important behaviour. You need not construct on

Computer organisation, Write-through vs. write-back caches

Write-through vs. write-back caches

Determine resources, Consider the following system snapshot using data stru...

Consider the following system snapshot using data structures in the Banker's algorithm, with resources A, B, C, and D, and process P0 to P4: Max

Explain the methods of implementing interacting processes, Explain any two ...

Explain any two methods of implementing interacting processes. Two methods of implementing interacting process are given below: (i) Shared memory solution: In this scheme

State the use of erasable programmable read only memory, Erasable programma...

Erasable programmable read only memory (EPROM) This is a special type of PROM which can be erased by exposing it to ultraviolet (UV) light. Once it has been erased, it can be r

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages