- Recall:
- Bridges
exchange
configuration messages
in order to:
- Find the tree that is rooted at the bridge with the smallest ID
- Bridges
exchange
configuration messages
in order to:
- I will first illustrate the
processing with
a concrete example
- I will start with the
initial state:
- Suppose
that:
- bridge 1 sends the
configuration message:
(ID=1 , Root=1 , Dist=0)
to all its neighboring nodes:
- bridge 1 sends the
configuration message:
- How the
bridge 2 processes the
configuration message
from bridge 1:
- Bridge 2 detects that
the information in the
configuration message can
improve its
current state (= assumption):
Explanation:
Bridge 2: Root ID = 2 Distance = 0 Configuration messages: Root ID = 1 <---- Smaller !! Distance = 0
Bridge 2 has discovered a better candidate for the root bridge !!! Bridge 2 will update its state variables to: Root ID = 1 Distance = 1 (= 0 + 1)Result:
- Bridge 2 detects that
the information in the
configuration message can
improve its
current state (= assumption):
- How the
bridge 0 processes the
configuration message
from bridge 1:
- Bridge 0 detects that
the information in the
configuration message can
not improve its
current state (= assumption):
Explanation:
Bridge 0: Root ID = 0 Distance = 0 Configuration messages: Root ID = 1 <---- Smaller !! Distance = 0
Bridge 0 itself has the better candidate for the root bridge !!! Bridge 2 will NOT update its state variables
- Bridge 0 detects that
the information in the
configuration message can
not improve its
current state (= assumption):