Network Blocking Probability Presentation for Voice Communication Engineering. Designed by Dhawal G. Sharma(Electronics and Telecommunication Student) Main Reference - Lee's Blocking Probability by C.Y. Lee

1. etwork Blocking P robability By – Dhawal G. Sharma

3. a brief history of communication…

4. Pigeon Delivery

5. Voice Messaging

6. Primitive Telephone

7. Dialer Telephone

8. Type-500 Telephone

9. DTMF Telephone

10. Cordless Telephone

11. Wireless Telephony

12. Voice Devices

13. Enhancements

14. Desktop PCs

15. Multimedia Cellular Phones

16. Laptops

17. Satellite Telephony

18. Touch Telephony

19. elephone T Network

20. Hierarchy

21. The Focus

22. Centralised N/W

23. De-centralised N/W

24. Advantage of Decentralised N/W

25. Multi-stage N/W

26. Possible paths for 1 set

27. The Flow

28. Blocking Probability

30. Terminologies and Equations p = probability that the link is busy(Occupancy, loading or utilization percentage) q = probability that the link is idle = (1-p) n = no of parallel links used to complete a connection. Probability that all links are busy = (p)^n. = 1 - (q)^n

31. Consider a 3 stage n/w k = no of different paths p’ = probability that any particular inter-mediate link is busy q’ = probability that any particular inter-mediate link is idle Probability of blocking – B = (probability that all paths are busy) = (probability that an arbitrary link is busy)^k = (probability that atleast one link is busy)^k = (1 - (q’)^2)^k p’ = p/ β Β = k/n 3 stage n/w

32. 1 2 k p p p’ p’ p’ p’ 3 stage n/w

35. 2 1 3 (1 – q 2 q 3 ) B = p 1 (1 – q 2 q 3 ) p 2 p 3 p 1 End to End Blocking Probability

37. Designed & Presented by : Dhawal G. Sharma