Name
Abstract | ||
|---|---|---|
This paper investigates to what extent it is possible to use traceroute-style probing for accurately tracking Internet path changes. When the number of paths is large, the usual traceroute based approach misses many path changes because it probes all paths equally. Based on empirical observations, we argue that monitors can optimize probing according to the likelihood of path changes. We design a simple predictor of path changes using a nearest neighbor model. Although predicting path changes is not very accurate, we show that it can be used to improve probe targeting. Our path tracking method, called DTrack, detects up to two times more path changes than traditional probing, with lower detection delay, as well as providing complete load-balancer information. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/2018436.2018451 | SIGCOMM |
Keywords | Field | DocType |
internet path change,path change,lower detection delay,nearest neighbor model,empirical observation,path tracking method,usual traceroute,simple predictor,complete load-balancer information,prediction,load balance,nearest neighbor,tracking | k-nearest neighbors algorithm,Any-angle path planning,Computer science,traceroute,Topology mapping,Path tracking,Fast path,Distributed computing,The Internet | Conference |
Volume | Issue | ISSN |
41 | 4 | 0146-4833 |
Citations | PageRank | References |
11 | 0.58 | 29 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Italo Cunha | 1 | 22 | 1.58 |
| Renata Teixeira | 2 | 1636 | 100.35 |
| Darryl Veitch | 3 | 903 | 84.47 |
| Christophe Diot | 4 | 7831 | 590.69 |