Node failure localization via network tomography

Liang Ma, Ting He, Ananthram Swami, Don Towsley, Kin K. Leung, Jessica Lowe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

Abstract

We investigate the problem of localizing node failures in a communication network from end-to-end path measurements, under the assumption that a path behaves normally if and only if it does not contain any failed nodes. To uniquely localize node failures, the measurement paths must show different symptoms under different failure events, i.e., for any two distinct sets of failed nodes, there must be a measurement path traversing one and only one of them. This condition is, however, impractical to test for large networks. Our first contribution is a characterization of this condition in terms of easily verifiable conditions on the network topology with given monitor placements under three families of probing mechanisms, which differ in whether measurement paths are (i) arbitrarily controllable, (ii) controllable but cycle-free, or (iii) uncontrollable (i.e., determined by the default routing protocol). Our second contribution is a characterization of the maximum identifiability of node failures, measured by the maximum number of simultaneous failures that can always be uniquely localized. Specifically, we bound the maximal identifiability from both the upper and the lower bounds which differ by at most one, and show that these bounds can be evaluated in polynomial time. Finally, we quantify the impact of the probing mechanism on the capability of node failure localization under different probing mechanisms on both random and real network topologies. We observe that despite a higher implementation cost, probing along controllable paths can significantly improve a network's capability to localize simultaneous node failures.

Original languageEnglish (US)
Title of host publicationIMC 2014 - Proceedings of the 2014 ACM
PublisherAssociation for Computing Machinery
Pages195-208
Number of pages14
ISBN (Electronic)9781450332132
DOIs
StatePublished - Nov 5 2014
Event2014 ACM Internet Measurement Conference, IMC 2014 - Vancouver, Canada
Duration: Nov 5 2014Nov 7 2014

Publication series

NameProceedings of the ACM SIGCOMM Internet Measurement Conference, IMC

Other

Other2014 ACM Internet Measurement Conference, IMC 2014
CountryCanada
CityVancouver
Period11/5/1411/7/14

Fingerprint

Tomography
Topology
Routing protocols
Telecommunication networks
Polynomials
Costs

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications

Cite this

Ma, L., He, T., Swami, A., Towsley, D., Leung, K. K., & Lowe, J. (2014). Node failure localization via network tomography. In IMC 2014 - Proceedings of the 2014 ACM (pp. 195-208). (Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC). Association for Computing Machinery. https://doi.org/10.1145/2663716.2663723
Ma, Liang ; He, Ting ; Swami, Ananthram ; Towsley, Don ; Leung, Kin K. ; Lowe, Jessica. / Node failure localization via network tomography. IMC 2014 - Proceedings of the 2014 ACM. Association for Computing Machinery, 2014. pp. 195-208 (Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC).
@inproceedings{40522d58d0da47a8be070bce5efe21b6,
title = "Node failure localization via network tomography",
abstract = "We investigate the problem of localizing node failures in a communication network from end-to-end path measurements, under the assumption that a path behaves normally if and only if it does not contain any failed nodes. To uniquely localize node failures, the measurement paths must show different symptoms under different failure events, i.e., for any two distinct sets of failed nodes, there must be a measurement path traversing one and only one of them. This condition is, however, impractical to test for large networks. Our first contribution is a characterization of this condition in terms of easily verifiable conditions on the network topology with given monitor placements under three families of probing mechanisms, which differ in whether measurement paths are (i) arbitrarily controllable, (ii) controllable but cycle-free, or (iii) uncontrollable (i.e., determined by the default routing protocol). Our second contribution is a characterization of the maximum identifiability of node failures, measured by the maximum number of simultaneous failures that can always be uniquely localized. Specifically, we bound the maximal identifiability from both the upper and the lower bounds which differ by at most one, and show that these bounds can be evaluated in polynomial time. Finally, we quantify the impact of the probing mechanism on the capability of node failure localization under different probing mechanisms on both random and real network topologies. We observe that despite a higher implementation cost, probing along controllable paths can significantly improve a network's capability to localize simultaneous node failures.",
author = "Liang Ma and Ting He and Ananthram Swami and Don Towsley and Leung, {Kin K.} and Jessica Lowe",
year = "2014",
month = "11",
day = "5",
doi = "10.1145/2663716.2663723",
language = "English (US)",
series = "Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC",
publisher = "Association for Computing Machinery",
pages = "195--208",
booktitle = "IMC 2014 - Proceedings of the 2014 ACM",

}

Ma, L, He, T, Swami, A, Towsley, D, Leung, KK & Lowe, J 2014, Node failure localization via network tomography. in IMC 2014 - Proceedings of the 2014 ACM. Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC, Association for Computing Machinery, pp. 195-208, 2014 ACM Internet Measurement Conference, IMC 2014, Vancouver, Canada, 11/5/14. https://doi.org/10.1145/2663716.2663723

Node failure localization via network tomography. / Ma, Liang; He, Ting; Swami, Ananthram; Towsley, Don; Leung, Kin K.; Lowe, Jessica.

IMC 2014 - Proceedings of the 2014 ACM. Association for Computing Machinery, 2014. p. 195-208 (Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Node failure localization via network tomography

AU - Ma, Liang

AU - He, Ting

AU - Swami, Ananthram

AU - Towsley, Don

AU - Leung, Kin K.

AU - Lowe, Jessica

PY - 2014/11/5

Y1 - 2014/11/5

N2 - We investigate the problem of localizing node failures in a communication network from end-to-end path measurements, under the assumption that a path behaves normally if and only if it does not contain any failed nodes. To uniquely localize node failures, the measurement paths must show different symptoms under different failure events, i.e., for any two distinct sets of failed nodes, there must be a measurement path traversing one and only one of them. This condition is, however, impractical to test for large networks. Our first contribution is a characterization of this condition in terms of easily verifiable conditions on the network topology with given monitor placements under three families of probing mechanisms, which differ in whether measurement paths are (i) arbitrarily controllable, (ii) controllable but cycle-free, or (iii) uncontrollable (i.e., determined by the default routing protocol). Our second contribution is a characterization of the maximum identifiability of node failures, measured by the maximum number of simultaneous failures that can always be uniquely localized. Specifically, we bound the maximal identifiability from both the upper and the lower bounds which differ by at most one, and show that these bounds can be evaluated in polynomial time. Finally, we quantify the impact of the probing mechanism on the capability of node failure localization under different probing mechanisms on both random and real network topologies. We observe that despite a higher implementation cost, probing along controllable paths can significantly improve a network's capability to localize simultaneous node failures.

AB - We investigate the problem of localizing node failures in a communication network from end-to-end path measurements, under the assumption that a path behaves normally if and only if it does not contain any failed nodes. To uniquely localize node failures, the measurement paths must show different symptoms under different failure events, i.e., for any two distinct sets of failed nodes, there must be a measurement path traversing one and only one of them. This condition is, however, impractical to test for large networks. Our first contribution is a characterization of this condition in terms of easily verifiable conditions on the network topology with given monitor placements under three families of probing mechanisms, which differ in whether measurement paths are (i) arbitrarily controllable, (ii) controllable but cycle-free, or (iii) uncontrollable (i.e., determined by the default routing protocol). Our second contribution is a characterization of the maximum identifiability of node failures, measured by the maximum number of simultaneous failures that can always be uniquely localized. Specifically, we bound the maximal identifiability from both the upper and the lower bounds which differ by at most one, and show that these bounds can be evaluated in polynomial time. Finally, we quantify the impact of the probing mechanism on the capability of node failure localization under different probing mechanisms on both random and real network topologies. We observe that despite a higher implementation cost, probing along controllable paths can significantly improve a network's capability to localize simultaneous node failures.

UR - http://www.scopus.com/inward/record.url?scp=84910155814&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84910155814&partnerID=8YFLogxK

U2 - 10.1145/2663716.2663723

DO - 10.1145/2663716.2663723

M3 - Conference contribution

AN - SCOPUS:84910155814

T3 - Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC

SP - 195

EP - 208

BT - IMC 2014 - Proceedings of the 2014 ACM

PB - Association for Computing Machinery

ER -

Ma L, He T, Swami A, Towsley D, Leung KK, Lowe J. Node failure localization via network tomography. In IMC 2014 - Proceedings of the 2014 ACM. Association for Computing Machinery. 2014. p. 195-208. (Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC). https://doi.org/10.1145/2663716.2663723