Kursliste Registrer Logg inn

Informasjon

Forfatter(e) Olivier Bonaventure
Frist Ingen frist
Innleveringsgrense Ingen begrensning
Kategorimerkelapper ethernet

Merkelapper

Logg inn

Logg inn

The spanning tree protocol

Consider the network shown in the figure below

https://inginious.org/course/cnp3/q-stp-1/figure.png

In this network, all links have a cost of 1.

Spørsmål 1: What is the root switch in this network ?

Return the integer that identifies the root switch.

Spørsmål 2: What is the BPDU sent by the root ?

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

Spørsmål 3: What is the BPDU sent by switch 4 in this network ?

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

Spørsmål 4: What is the BPDU sent by switch 7 in this network ?
Spørsmål 5: What is the BPDU sent by switch 9 in this network ?
Spørsmål 6: Interfaces in the Root state

The Spanning Tree protocol associates one state (Root, Designated or Blocked) to each switch interface. How many switch interfaces are in the Root state in the entire network ?

Spørsmål 7: Interfaces in the Blocked state

The Spanning Tree protocol associates one state (Root, Designated or Blocked) to each switch interface. How many switch interfaces are in the Blocked state in the entire network ?

Spørsmål 8: State of the interface between S4 and S6

What is the state of the interface that switch S4 uses to send frames to switch S6 ? Reply with Root, Designated or Blocked.

Spørsmål 9: State of the interface between S4 and S7

What is the state of the interface that switch S4 uses to send frames to switch S7 ? Reply with Root, Designated or Blocked.