Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
Author: Nguyen, H.
Teixeira, R.
Thiran, P.
Diot, C.
Citation: 2009 Proceedings of IEEE INFOCOM: pp.1386-1394
Publisher: IEEE
Publisher Place: USA
Issue Date: 2009
ISBN: 9781424435135
ISSN: 0743-166X
Conference Name: IEEE INFOCOM Conference (2009 : Rio de Janeiro, Brazil)
Statement of
Hung X. Nguyen, Renata Teixeira, Patrick Thiran, Christophe Diot
Abstract: 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.
Rights: Copyright © 2009 by The Institute of Electrical and Electronics Engineers, Inc. All rights reserved.
DOI: 10.1109/INFCOM.2009.5062054
Published version:
Appears in Collections:Aurora harvest
Electrical and Electronic Engineering publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.