Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Outline
Motivation
RIP-TP design(Triangle Checking and Probing) Simulation Evaluation
Summary
2/20
ARPANet in 1971[McQuillan:TOC78(12)]
3/20
Mis-configurations [Mahajan:SIGCOMM02]
4/20
D
A
D:1
R C
5/20
Outline
Motivation
Summary
6/20
# of probing messages adaptive to # of suspicious distances per update discard those distances that failed verification
7/20
b
Dist(a,b) Dist(b,c) Dist(a,c)
Dist(a,c)Dist(a,b)+Dist(b,c)
8/20
a UDP packet with un-used port number TTL = Dist(A,D) +1 (assuming routing metric is hop-count) A timer: expiration time proportional to TTL
QuickTime and a TIFF (LZW) decompressor are needed to see this picture.
10/20
a UDP packet with un-used port number TTL = Dist(A,D) +1 (assuming routing metric is hop-count) A timer: expiration time proportional to TTL
TTL=0
QuickTime and a TIFF (LZW) decompressor are needed to see this picture.
11/20
a UDP packet with un-used port number TTL = Dist(A,D) +1 (assuming routing metric is hop-count) A timer: expiration time proportional to TTL
QuickTime and a TIFF (LZW) decompressor are needed to see this picture.
Timer Expires!
12/20
13/20
Outline
Simulation Evaluation
Summary
14/20
Simulation Scenario
One faulty router selects I destinations, and decreases each distance by 1; I:1~8
Detection Rate vs I
Detection Rate
RIP-TP
Faulty router sends I invalid distances, causing J invalid distances propagated in the network.
M of J are detected. Detection rate=M/J
Overhead vs I
Overhead= (Total Number of Probing messages)/ (Total Number of RIP messages) RIP-TP
Overhead
18/20
Related work
Sign the routing updates [Perlman88, Smith:NDSS97, Kent:J-SAC00] Update Counts Statistics[Mittal:CCS02]
Summary
is not only feasible, but can be done effectively with low overhead.
Future work:
20/20
22/20