FEET let to thIIhOI oIOIQ EoFIE the.to let to EIIeo - - PDF document
Flooding on recv(pkt, ifin): 1h37 for i in interfaces: if i != ifin: 2 send(pkt, i) I Too 2 0 TOLE If Deliver Packets Bat HI The Cycles Bad Packet Destinationitf FEET let to thIIhOI oIOIQ EoFIE the.to let to EIIeo
Flooding
1h37
2
I
2
TOLE
HI
Deliver Packets
The
Cycles
Packet
Destinationitf
for i in interfaces: if i != ifin: send(pkt, i)
to
let
the.to
to
let
EEEIIf
f O
t 1
Io.toIEEII.fEo.yo
lhOI
E
b 3
t
HhI
e
i
F
In
EEE
Packets
everywhere all thetime
How to solve
How many packets
should beremembered
How much memory
are
no cycles
Remove links so that
no cycles remain
Without Disconnecting
Graph
IIo
HI
The
1h37
THI
MY
FOLK
Assume
all networks
are
designed tobe.org
It
Done by someone
else
in many
environments
Modifiedflood
O
deactivated'ER
Deactivated
deactivated = Set()
if ifin in deactivated: return for i in interfaces: if (i !=ifin and i not in deactivated): send(pkt, i)
Algorithm that converts graph witch codes
to acyclic graph
4
fr
tlDO
OB Oc Ffh
Requirements
Acyclic A
khI
Spanning
Do 03
0 Ehf
Root
ro.toEioFII
trEPEoIninsEEe
How
Algorithm
R
id roofdist
eo.to
r
I
t
da.A
h
Ai
see
1
7
Step 2
Root = id On boot: Bcast((root=root) On recv(p, i): If p.root < root: Root = p.root Bcast((root = root)
Putting it alltogether