Informations

Auteur(s) Emilie Deprez
Date limite Pas de date limite
Limite de soumission Pas de limite
Étiquettes de catégories ethernet

Etiquettes

Se connecter

The spanning tree protocol - step by step - 1

Consider the network shown in the figure below where all links have a cost of 1.

1 2 1 2 1 2

Question 1: Root switch

Which is the root switch in this network ?

Provide your answer as Sx where x is the number of the switch

Question 2: BPDU sent

What is the BPDU sent by switch in this network ?

Provide your answer as R=123, C=456, T=789

Question 3: BPDU sent

What is the BPDU sent by switch in this network ?

Provide your answer as R=123, C=456, T=789

Question 4: BPDU sent

What is the BPDU sent by switch in this network ?

Provide your answer as R=123, C=456, T=789

Question 5: Best BPDU

Between and , which switch has the best BPDU ?

Provide your answer as Sx where x is the number of the switch

Question 6: Best BPDU

Between and , which switch has the best BPDU ?

Provide your answer as Sx where x is the number of the switch

Question 7: Best BPDU

Between and , which switch has the best BPDU ?

Provide your answer as Sx where x is the number of the switch

Question 8: Port State

What is the state of each port of ?

Provide your answer as 1:root, 2:designated, 3:blocked, ...

Question 9: Port State

What is the state of each port of ?

Provide your answer as 1:root, 2:designated, 3:blocked, ...

Question 10: Port State

What is the state of each port of ?

Provide your answer as 1:root, 2:designated, 3:blocked, ...