Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P....
-
Upload
octavia-lane -
Category
Documents
-
view
218 -
download
0
Transcript of Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P....
![Page 1: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/1.jpg)
Doubletree: a Way to Reduce Redundancy in Traceroute Systems
Benoit Donnetjoint work with P. Raoult, T. Friedman and
M. Crovella
CAIDA – San Diego (Sept. 2005)
![Page 2: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/2.jpg)
Context
● Network measurement● Internet topology discovery using distributed
traceroute monitors– IP interface level
● Existing tools:– Skitter (CAIDA)
– TTM (RIPE NCC)
– AMP (NLANR)
– DIMES (Tel Aviv U.)
![Page 3: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/3.jpg)
Problem: Intra-Monitor Redundancy
![Page 4: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/4.jpg)
Problem: Inter-Monitor Redundancy
![Page 5: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/5.jpg)
Statement
● Classical approaches are out of date● Wide scale deployment of traceroute tools
– DIMES
● Scale up the number of monitors– little work on efficiency
● Be careful regarding– network resources
– load on destinations
![Page 6: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/6.jpg)
Doubletree: Basics
● Cooperative algorithm● Goal: avoiding paths already explored● Exploits tree-like structure of routes in the
internet:– from a monitor to a set of destinations:
● monitor-rooted tree
– from a set of monitors to a destination: ● destination-rooted tree
![Page 7: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/7.jpg)
Doubletree: Monitor-Rooted Tree
![Page 8: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/8.jpg)
Doubletree: Destination-Rooted Tree
![Page 9: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/9.jpg)
Doubletree: Reconciliation
● Backward and forward probing are opposite schemes
● How can we reconcile them?– Starts probing at some hop h
● First, forward probing from h● Second, backward probing from h-1
● How to choose h?– Probability p of hitting a destination with the very
first probe sent
![Page 10: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/10.jpg)
Doubletree: Reconciliation (2)
![Page 11: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/11.jpg)
Doubletree: Stop Sets
● Not necessary to maintain the whole tree structure.
● Each monitor uses stop sets: {(interface, root)}– Local Stop Set B: {interface}
● Backward probing
– Global Stop Set F: {(interface, destination)}● Forward probing● Shared between monitors● Could be implemented as Bloom filter
![Page 12: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/12.jpg)
Doubletree: Coverage
![Page 13: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/13.jpg)
Doubletree: Redundancy
![Page 14: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/14.jpg)
Doubletree: Amount of Probes
![Page 15: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/15.jpg)
Doubletree: Implementation
![Page 16: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/16.jpg)
Future Works
● Improvement to Doubletree– Reducing the amount of probes sent
● Capturing the dynamicity of the network● BGP-guided probing● Overlay/P2P structure organizing the whole
system● Measurement tools standardization
![Page 17: Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.](https://reader034.fdocuments.net/reader034/viewer/2022051620/56649ee15503460f94bf20b2/html5/thumbnails/17.jpg)
Conclusion
● Doubletree is an efficient and cooperative algorithm allowing– redundancy reduction
– good coverage level
● Java implementation of a prototype