Network Tomography on Correlated Links
description
Transcript of Network Tomography on Correlated Links
![Page 1: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/1.jpg)
École Polytechnique Fédérale de Lausanne
Network Tomography on Correlated Links
Denisa Ghita
Katerina Argyraki
Patrick Thiran
IMC 2010, Melbourne, Australia
![Page 2: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/2.jpg)
Network Tomography
Internet Service Provider
2
Network tomography infers links characteristics from path measurements.
![Page 3: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/3.jpg)
3
Current Tomographic Methods assume Link Independence
![Page 4: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/4.jpg)
4
Current Tomographic Methods assume Link Independence
Links can be correlated!
![Page 5: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/5.jpg)
5
Can we use network tomography when links are correlated?
Yes, we can!
![Page 6: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/6.jpg)
6
All
Link Correlation Model
links are independent.Some
possibly correlated
independent
Independence among correlation sets!
![Page 7: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/7.jpg)
7
How to find the Possibly Correlated Links?
Links in the same local-area network may be correlated!
Links in the same administrative domain may be correlated!
![Page 8: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/8.jpg)
8
The Probability that a Link is Faulty
link is faultyP( ) = ?
![Page 9: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/9.jpg)
9
Our Main Contribution
P( link faulty) = ?
P( link faulty) = ?
P( link faulty) = ?
P( link faulty) = ?
Theorem that states the necessary and sufficient condition to identify the probability that each link is faulty when links in the network are correlated.
P( link faulty) =…
P( link faulty) =…
P( link faulty) =…
P( link fa
ulty) =…
![Page 10: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/10.jpg)
10
Our ConditionEach subset of a correlation set must be covered by a different set of paths!
![Page 11: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/11.jpg)
11
A
B
Identifiable
Our Condition
Subset of aCorrelation Set Covered Paths
eAB eBC eBD eBC, eBD
Each subset of a correlation set must be covered by a different set of paths!
C
D
1. Define the subsets of the correlation sets.
2. Find the paths that cover each subset.
3. Are any subsets covered by the same paths?
![Page 12: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/12.jpg)
12
Our ConditionA
B
C
D
Identifiable
ESubset of aCorrelation Set
eAB eBC eBD eBC, eBD
Covered Paths
eEB
![Page 13: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/13.jpg)
13
The Gist behind the Algorithm
Solvable!3 equations 4 unknowns
P( PAC good ) = P(eAB good) P(eBC good)
P( PAD good ) = P(eAB good) P(eBD good)
P( PED good ) = P(eEB good) P(eBD good)
BC
DE
A
![Page 14: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/14.jpg)
14
The Gist behind the Algorithm
P( PAC good ) = P(eAB good) P(eBC good)
P( PAD good ) = P(eAB good) P(eBD good)
P( PED good ) = P(eEB good) P(eBD good)
BC
DE
A
P( PAC , PAD good ) = P(eAB good) P(eBD ,eBC good)
P(eBDgood)P(eBC good)≠
![Page 15: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/15.jpg)
15
The Gist behind the Algorithm
P( PAC good ) = P(eAB good) P(eBC good)
P( PAD good ) = P(eAB good) P(eBD good)
P( PED good ) = P(eEB good) P(eBD good)
BC
DE
A
P( PAC , PAD good ) = P(eAB good) P(eBD ,eBC good)
P( PAD , PED good ) = P(eAB good) P(eEB good) P(eBD good)
Solvable !5 unknowns5 equations
![Page 16: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/16.jpg)
16
The Gist behind the Algorithm
P( PAC good ) = P(eAB good) P(eBC good)
P( PAD good ) = P(eAB good) P(eBD good)
P( PED good ) = P(eEB good) P(eBD good)
BC
DE
A
P( PAC , PAD good ) = P(eAB good) P(eBD ,eBC good)
P( PAD , PED good ) = P(eAB good) P(eEB good) P(eBD good)
Solvable !5 unknowns5 equations
Correlation set of 40 links -> 240 unknowns !!!
![Page 17: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/17.jpg)
17
The Gist behind the Algorithm
P( PAC good ) = P(eAB good) P(eBC good)
P( PAD good ) = P(eAB good) P(eBD good)
P( PED good ) = P(eEB good) P(eBD good)
BC
DE
A
P( PAC , PAD good ) = P(eAB good) P(eBD ,eBC good)
P( PAD , PED good ) = P(eAB good) P(eEB good) P(eBD good)
Solvable !5 unknowns5 equations
Correlation set of 40 links -> 240 unknowns !!!
Consider only sets of paths that do not cover correlated links !
![Page 18: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/18.jpg)
18
The Gist behind the Algorithm
P( PAC good ) = P(eAB good) P(eBC good)
P( PAD good ) = P(eAB good) P(eBD good)
P( PED good ) = P(eEB good) P(eBD good)
BC
DE
A
P( PAC , PAD good ) = P(eAB good) P(eBD ,eBC good)
P( PAD , PED good ) = P(eAB good) P(eEB good) P(eBD good)
Consider only sets of paths that do not cover correlated links !
Solvable!4 unknowns 4 equations
![Page 19: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/19.jpg)
19
Simulations – Domain Level Tomography
Actual Topology Measured Topology
![Page 20: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/20.jpg)
20
Simulations – Domain Level Tomography
absolute error between the actual probability that a link is faulty, and the probability inferred by the algorithm.
![Page 21: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/21.jpg)
21
Simulations – Domain Level Tomography
absolute error between the actual probability that a link is faulty, and the probability inferred by the algorithm.
![Page 22: Network Tomography on Correlated Links](https://reader036.fdocuments.net/reader036/viewer/2022070421/56816276550346895dd2e799/html5/thumbnails/22.jpg)
22
Conclusion
• We study network tomography on correlated links.
• We formally prove under which necessary and sufficient condition the probabilities that links are faulty are identifiable.
• Our tomographic algorithm determines accurately the probabilities that links are faulty in a variety of congestion scenarios.