![EE 333, Communication Networks
Quiz-II (2013-14S)
Maximum Marks = 10 Time=45 minutes
1. For the network shown (with
costs of individual segments as
indicated), find the spanning tree
that will be obtained by applying
the standard spanning tree
algorithm. Clearly indicate the root
port of each bridge and the
designated port for each LAN
segment. [4]
2.
(a) Apply Dijkstra’s Algorithm to the network
shown to find the least cost paths from Node 1 to
all the other nodes of the network. Show all the
steps of the procedure in detail (cost and path at
each step) and draw the corresponding tree from
Node 1 to the other nodes of the network. Give
the forwarding table that Node 1 will use to send
packets to the other nodes. [4]
(b) If Node 1 wants to multicast to all the other nodes, what would be the cost of doing this
using the router set up of (a)? [1]
(c) We would like to find the two best paths from a source S to a destination D (in any general
network) so that the two paths do not share any common link. Suggest a way to do this. [1]](https://image.slidesharecdn.com/quiz-2-150425103656-conversion-gate02/85/Quiz-2-1-320.jpg)
Recommandé
Contenu connexe
Tendances
Tendances (20)
En vedette
En vedette (14)
Similaire à Quiz 2
Similaire à Quiz 2 (20)
Plus de Gopi Saiteja
Plus de Gopi Saiteja (20)
Dernier
Dernier (20)
Quiz 2
- 1. EE 333, Communication Networks Quiz-II (2013-14S) Maximum Marks = 10 Time=45 minutes 1. For the network shown (with costs of individual segments as indicated), find the spanning tree that will be obtained by applying the standard spanning tree algorithm. Clearly indicate the root port of each bridge and the designated port for each LAN segment. [4] 2. (a) Apply Dijkstra’s Algorithm to the network shown to find the least cost paths from Node 1 to all the other nodes of the network. Show all the steps of the procedure in detail (cost and path at each step) and draw the corresponding tree from Node 1 to the other nodes of the network. Give the forwarding table that Node 1 will use to send packets to the other nodes. [4] (b) If Node 1 wants to multicast to all the other nodes, what would be the cost of doing this using the router set up of (a)? [1] (c) We would like to find the two best paths from a source S to a destination D (in any general network) so that the two paths do not share any common link. Suggest a way to do this. [1]