presention of networking of bscs (5) M.rashid

1. Computer Networking
JAVED SHAHEEN MATYANA

2. summary
 Unicasting
 Multicasting
 Types of Multicast Routing
I. MultiCast Routing
II. Distance vector Routing
 Types of Unicast Routing
I. Dense Routing
II. Sparse Routing

3. Multicast Routing Algorithm
 The routing Algorithm used multicast routing.
 A single router in a network can be a part of
two or more different Groups.

4. Example of Spanning Tree

5. Pruning The Spanning Tree

6. Techniques of Pruning the Spanning Tree
 Algorithms used for pruning
 Link State Routing
Protocol used for this technique is MOSPF
(Multicast Open shortest path first)
 Distance Vector Routing
protocol used for this technique is DVMRP
(Distance vector Multicast routing protocol)

7. Distance Vector Multicast Routing
 It’s a Adapted or Dynamic Algorithms.
 Each router maintain tables called “vector”.
 Each router is known best Distance to reach another router.
 Table are Updated or exchanging information with
neighbor's(router).
 Also known as Bellman-ford algorithms.
 Distance is basically consider by No’s of hops.
 Or Delay etc…..

8. Example

10. Example

11. Example