- Posts: 2
- Thank you received: 0
RSTP ?
18 years 10 months ago #12663
by havohej
Replied by havohej on topic Re: RSTP ?
HI.
Simplifying if you know or have little experience with spanning tree, the implementing rstp is an easy task.
first there are 5 states in spanning tree:
disabled
blocking
listening
learning
forwarding
each state has its own time unitl it changes to the other time, so in the Rstp implementation the first three states resume into only one state called discarding, so there are only three states:
DISCARDING
LEARNING
FORWARDING
THE ADVANTAGE WITH RSTP IS LESS CONVERGE TIME OR LESS TIME FOR THE PORT TO CHANGE FROM BLOCKING TO FORWARDING.
ANOTHER FEATURE IS THAT THE SWITCH THAT SUFFERS THE CHANGE OR INESTABILITY INMEDIATELY FORWARDS THE NEW INFO BPDUS TO ALL THE SWITCHES, INSTEAD OF THE OLD STP THAT IT MUST INFORM THE ROOT SWITCH AND THEN THE ROOT SWITCH INFORMS ALL THE SWITCHES ABOUT THE NEW LAYER 2 TOPOLOGY.
BYE.
Simplifying if you know or have little experience with spanning tree, the implementing rstp is an easy task.
first there are 5 states in spanning tree:
disabled
blocking
listening
learning
forwarding
each state has its own time unitl it changes to the other time, so in the Rstp implementation the first three states resume into only one state called discarding, so there are only three states:
DISCARDING
LEARNING
FORWARDING
THE ADVANTAGE WITH RSTP IS LESS CONVERGE TIME OR LESS TIME FOR THE PORT TO CHANGE FROM BLOCKING TO FORWARDING.
ANOTHER FEATURE IS THAT THE SWITCH THAT SUFFERS THE CHANGE OR INESTABILITY INMEDIATELY FORWARDS THE NEW INFO BPDUS TO ALL THE SWITCHES, INSTEAD OF THE OLD STP THAT IT MUST INFORM THE ROOT SWITCH AND THEN THE ROOT SWITCH INFORMS ALL THE SWITCHES ABOUT THE NEW LAYER 2 TOPOLOGY.
BYE.
Time to create page: 0.111 seconds