Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis

Hung Nguyen
Renata Teixeira
Patrick Thiran
  • Fonction : Auteur
Christophe Diot
  • Fonction : Auteur

Résumé

The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors send probes toward a set of target end-hosts to detect failures in a given set of IP interfaces. Unfortunately, there is a large probing cost to monitor paths between all monitors and targets at a very high frequency. We make two major contributions to reduce this probing cost. First, we propose a formulation of the probe optimization problem which, in contrast to the established formulation, is not NP complete. Second, we propose two linear programming algorithms to minimize probing cost. Our algorithms combine low frequency per-path probing to detect per-interface failures at a higher frequency. We analyze our solutions both analytically and experimentally. Our theoretical results show that the probing cost increases linearly with the number of interfaces in a random power-law graph. We confirm this linear increase in Internet graphs measured from PlanetLab and RON. Hence, Internet graphs belong to the most costly class of graph to probe.
Fichier non déposé

Dates et versions

hal-01295285 , version 1 (30-03-2016)

Identifiants

Citer

Hung Nguyen, Renata Teixeira, Patrick Thiran, Christophe Diot. Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis. IEEE Infocom, Apr 2009, Rio de Janeiro, Brazil. pp.1386-1394, ⟨10.1109/INFCOM.2009.5062054⟩. ⟨hal-01295285⟩
35 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More