Spanning Shrub Protocol

 Spanning Tree Protocol Exploration Paper

Spanning Forest Protocol

• The Comprising Tree Protocol detects and prevents

spiral in bridged or changed internetworks simply by

preventing some links coming from being used

• Each Link has a one of a kind bridge IDENTITY formed from

concatenating a defined priority with one of the

Bridge's MAC details

• The Spanning Forest Protocol starts by all bridges

broadcasting Connection Protocol Data Units (BPDUs)

which informs all the other bridges of the

sending bridge's identity

• The bridge with the lowest Bridge ID is usually elected since the

root bridge

Comprising Tree Process

• Every network contains a default price, based on speed

• The basis Bridge broadcasts another BPDU and all the

other connections forward the broadcast yet add their particular

cost in a field within the BPDU

• A link will receive replications of the contacts

forwarded via all the other bridges

• It is therefore easy for a bridge to find which of its

ports has the lowest cost path to the root. This is

known as the root interface and it will be applied for

forwarding

• All of the ports of the root bridge are underlying ports

Comprising Tree Process

• In the case of a tie, the lowest slot number is

selected

• From every LAN, the bridge dock that has the best

cost path to the root is referred to as the chosen port.

In the case of a connect the lowest connection ID will be

selected

• Once the underlying ports and designated slots have been

found out they will be intended for forwarding and

all other slots are obstructed

• A spanning shrub (fully linked with no loops)

rooted at the bottom bridge is usually therefore produced

Spanning Woods Protocol

• The root bridge broadcasts BPDUs every

two seconds as well as the spanning forest gets

recalculated if a link stops obtaining

BPDUs

• If a bridge stops getting BPDUs upon its

connection port it will restart the protocol and

attempt to become the root bridge by

transmitting BPDUs to other bridges which

will do the same and elect a new root connection

Spanning Tree Protocol - Example one particular

Bridge one particular

P=2, A=1

R

Connect 2

P=1, A=2

you

R

L

1

0

R

Link 3

P=1, A=3

0

R

Ur

1

Bridge 4

P=2, A=4

Connection 5

P=1, A=5

By

D

two

1

a couple of

These 10Base-5 Ethernets almost all work at the same speed and that we

can give all a cost of just one to make the calculations easier

Spanning Tree Protocol - Example 2

Connection 1

P=2, A=1

R

Bridge 2

P=2, A=2

2

Deb

R

a couple of

3

L

Bridge 3

P=1, A=3

1

3rd there�s r

R

you

Bridge some

P=2, A=4

Bridge five

P=1, A=5

X

Deb

2

0

3

These 10Base-5 Ethernets all work at the same rate and we

can give them all a cost of 1 to make the calculations less difficult

Spanning Woods Protocol – Exercise you

Bridge you

P=2, A=1

.

Bridge two

P=2, A=2

.

.

.

.

.

.

Bridge a few

P=2, A=3

.

.

.

.

Bridge 5

P=1, A=4

Bridge five

P=1, A=5

.

.

.

.

.

Spanning Forest Protocol – Exercise you

Bridge 1

P=2, A=1

R

Link 2

P=2, A=2

1

R

L

0

1

X

Link 3

P=2, A=3

2

R

M

2

Connect 4

P=1, A=4

Bridge 5

P=1, A=5

3rd there�s r

R

zero

1

a couple of

Spanning Woods Protocol – Exercise two

Bridge one particular

P=1, A=1

.

Bridge a couple of

P=2, A=2

.

.

.

.

.

.

Bridge three or more

P=1, A=3

.

.

.

.

Bridge four

P=1, A=4

Bridge a few

P=2, A=5

.

.

.

.

.

Spanning Tree Protocol – Exercise two

Bridge 1

P=1, A=1

R

Bridge 2

P=2, A=2

zero

R

R

1

you

D

Link 3

P=1, A=3

three or more

R

L

2

Connection 4

P=1, A=4

Connection 5

P=2, A=5

D

X

3

2

two

Spanning Shrub Protocol - Example several

10Base-T

C=100

X

G

19

Addresses = 1

Priority = 2

104

104

10Base-T

C=100

R

19