Minimizing probing cost for detecting interface failures: Algorithms and scalability analysis

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 1386-1394

  Nguyen, Hung X ^a   Teixeira, Renata ^b   Thiran, Patrick ^c   Diot, Christophe ^d  

^a UNIVERSITY OF ADELAIDE   (Australia)

^b SORBONNE UNIVERSITÉ   (France)

^c EPFL   (Switzerland)

^d Thomson ^*

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC DETECTION; COST-INCREASES; HIGHER FREQUENCIES; INTERFACE FAILURE; INTERNET GRAPHS; IP PATHS; LINEAR PROGRAMMING ALGORITHM; LOW FREQUENCY; NP COMPLETE; OPTIMIZATION PROBLEMS; PATH PROBING; PLANETLAB; POWER-LAW GRAPH; SCALABILITY ANALYSIS; THEORETICAL RESULT; VERY HIGH FREQUENCY;

COMPUTATIONAL COMPLEXITY; COSTS; INTERNET; INTERNET PROTOCOLS; LINEARIZATION; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBES; SET THEORY;

COST BENEFIT ANALYSIS;

EID: 70349668707     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062054     Document Type: Conference Paper

References (33)

1. A. Achlioptas, A. Clauset, D. Kempe, and C. Moore. On the bias of traceroute sampling or, power-law degree distribution of regular graphs. In Proc. STOC'05, 2005.
2. M. Aigner and M. Fromme. A game of cops and robbers. Discreet Applied Math., 8:1-12, 1984.
3. A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C.-N. Chuah, and C. Diot. Characterization of Failures in an IP Backbone. In Proc. IEEE INFOCOM, 2004.
4. David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, and Robert Morris. Resilient overlay networks. In Proc. 18th ACM SOSP, October 2001.
5. Brice Augustin, Timur Friedman, and Renata Teixeira. Measuring loadbalanced paths in the internet. In Proc. of the Internet Measurement Conference, October 2007.
6. Yigal Bejerano and Rajeev Rastogi. Robust monitoring of link delays and faults in IP networks. In Proc. IEEE INFOCOM, 2003.
7. Anthony Bonato, Pawel Pralat, and Changping Wang. Vertex pursuit games in stochastic network models. In Proceedings of CAAN07, pages 46-56, 2007.
8. Matthew Caesar and Jennifer Rexford. Building bug-tolerant routers with virtualization. In ACM SIGCOMM Workshop on Programmable Routers for the Extensible Services of Tomorrow (PRESTO), 2008.
9. F. Chung and L. Lu. The average distance in a random graph with given expected degrees. Internet Mathematics, 1:91-113, 2003.
10. Fan Chung and Linyuan Lu. The volume of the giant component for a random graph with given expected degrees. SIAM J. Discrete Math., 20:395-411, 2006.
11. R. Cohen and S. Havlin. Scale-free networks are ultrasmall. Physical Review Letters, 90(5), 2003.
12. G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, N.J., 1963.
13. P. Erdos and A. Renyi. On random graphs I. Publ. Math. Debrecen, 6:290-291, 1959.
14. L. Fang, A. Atlas, F. Chiussi, K. Kompella, and G. Swallow. LDP failure detection and recovery. IEEE Communication Magazine, 42(10):117-123, 2004.
15. N. Feamster and H. Balakrishnan. Detecting BGP Configuration Faults with Static Analysis. In Proc. USENIX Symposium on Networked Systems Design and Implementation, 2005.
16. D. Fisher and S. L. Fitzpatrick. The isometric path number of a graph. Journal of Combi. Math. Comput., 38:97-110, 2001.
17. M. R. Garey and D. S. Johnson. Computers and Intractibility: A guide to the theory of NP-completeness. W. H. Freeman, 1979.
18. B. Huffaker, M. Fomenkov, D. Moore, and k. claffy. Macroscopic analyses of the infrastructure: measurement and visualization of internet connectivity and performance. In Proc. of Passive and Active Measurement Workshop, 2001.
19. David Johnson. Approximation Algorithms For Combinatorial Problems. In Journal of Computer and System Sciences, 1974.
20. Ethan Katz-Bassett, Harsha V. Madhyastha, John P. John, Arvind Krishnamurthy, David Wetherall, and Thomas Anderson. Studying Black Holes in the Internet with Hubble. In Proc. USENIX Symposium on Networked Systems Design and Implementation, 2008.
21. Keynote Systems - The mobile and Internet performance authority. http://www.keynote.com/.
22. Ramana Rao Kompella, Jennifer Yates, Albert Greenberg, and Alex C. Snoeren. Detection and localization of network blackholes. In Proc. of IEEE Infocom, May 2007.
23. A. Lakhina, J. Byers, M. Crovella, and P. Xie. Sampling biases in ip topology measurements. In Proceeding of the IEEE INFOCOM'03, 2003.
24. Lun Li, David Alderson, and John C. Doyle. Towards a theory of scalefree graphs: Definition, properties, and implications. Internet Math., 2:431-523, August 2005.
25. R. Mahajan, D. Wetherall, and T. Anderson. Understanding bgp misconfiguration. In Proc. ACM SIGCOMM, 2002.
26. Z. Morley Mao, Jennifer Rexford, Jia Wang, and Randy H. Katz. Towards an accurate AS-level traceroute tool. In Proc. ACM SIGCOMM, 2003.
27. Hung Nguyen and Patrick Thiran. Active measurement for multiple link failures diagnosis in IP networks. In Proc. of Passive and Active Measurement Workshop, 2004.
28. Venkat Padmanabhan, Lili Qiu, and Helen Wang. Server-based Inference of Internet Link lossiness. In Proc. IEEE INFOCOM, 2003.
29. Jun-Jie Pan. Isometrics-path numbers of block graphs. Information Processing Letters, 93:99-102, 2005.
30. RIPE. Test Traffic Measurements Service. http://www.ripe.net/ttm/.
31. Joel Sommers, Paul Barford, Nick Duffield, and Amos Ron. Accurate and Efficient SLA Compliance Monitoring. In Proc. ACM SIGCOMM, 2007.
32. www.planet-lab.org.
33. M. Zhang, C. Zhang, V. Pai, L. Peterson, and R. Wang. PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area Services. In Proc.of USENIX OSDI, 2004.