Robust and efficient monitor placement for network tomography in dynamic networks

Ting He, Athanasios Gkelias, Liang Ma, Kin K. Leung, Ananthram Swami, Don Towsley

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

We consider the problem of placing the minimum number of monitors in a dynamic network to identify additive link metrics from path metrics measured along cycle-free paths between monitors. Our goal is robust monitor placement, i.e., the same set of monitors can maintain network identifiability under topology changes. Our main contribution is a set of monitor placement algorithms with different performancecomplexity tradeoffs that can simultaneously identify multiple topologies occurring during the network lifetime. In particular, we show that the optimal monitor placement is the solution to a generalized hitting set problem, for which we provide a polynomial-time algorithm to construct the input and a greedy algorithm to select the monitors with logarithmic approximation. Although the optimal placement is NP-hard in general, we identify non-trivial special cases that can be solved efficiently. Our secondary contribution is a dynamic triconnected decomposition algorithm to compute the input needed by the monitor placement algorithms, which is the first such algorithm that can handle edge deletions. Our evaluations on mobility-induced dynamic topologies verify the efficiency and the robustness of the proposed algorithms.

Original languageEnglish (US)
Article number7837714
Pages (from-to)1732-1745
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume25
Issue number3
DOIs
StatePublished - Jun 2017

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Robust and efficient monitor placement for network tomography in dynamic networks'. Together they form a unique fingerprint.

Cite this