Thomas Kunz
Systems and Computer Engineering
11
Distributed Algorithm, cont.
1
8
5
3
7
6
2
9
4
3
7
9
2
5
1
4
8
6
The spanning tree is constructed pictured
by the bold lines,
(1) is the leader with
initial token.
(4) is the initial candidate requiring the
token. When it receives the token, it decides
to migrate and broadcasts to its
neighbors (1) (6) (7) (9). Next (9) receives
the token and decides to migrate.
Following, (6) gets the token and
decides not to migrate….