Inferring link metrics from end-to-end path measurements: Identifiability and monitor placement

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

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

We investigate the problem of identifying individual link metrics in a communication network from end-to-end path measurements, under the assumption that link metrics are additive and constant. To uniquely identify the link metrics, the number of linearly independent measurement paths must equal the number of links. Our contribution is to characterize this condition in terms of the network topology and the number/placement of monitors, under the constraint that measurement paths must be cycle-free. Our main results are: 1) it is generally impossible to identify all the link metrics by using two monitors; 2) nevertheless, metrics of all the interior links not incident to any monitor are identifiable by two monitors if the topology satisfies a set of necessary and sufficient connectivity conditions; 3) these conditions naturally extend to a necessary and sufficient condition for identifying all the link metrics using three or more monitors. We show that these conditions not only facilitate efficient identifiability tests, but also enable an efficient algorithm to place the minimum number of monitors in order to identify all link metrics. Our evaluations on both random and real topologies show that the proposed algorithm achieves identifiability using a much smaller number of monitors than a baseline solution.

Original languageEnglish (US)
Article number2328668
Pages (from-to)1351-1368
Number of pages18
JournalIEEE/ACM Transactions on Networking
Volume22
Issue number4
DOIs
StatePublished - Jan 1 2014

Fingerprint

Topology
Telecommunication networks

All Science Journal Classification (ASJC) codes

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

Cite this

Ma, Liang ; He, Ting ; Leung, Kin K. ; Swami, Ananthram ; Towsley, Don. / Inferring link metrics from end-to-end path measurements : Identifiability and monitor placement. In: IEEE/ACM Transactions on Networking. 2014 ; Vol. 22, No. 4. pp. 1351-1368.
@article{96599ef4fd2e4c73ae155eae7c587e53,
title = "Inferring link metrics from end-to-end path measurements: Identifiability and monitor placement",
abstract = "We investigate the problem of identifying individual link metrics in a communication network from end-to-end path measurements, under the assumption that link metrics are additive and constant. To uniquely identify the link metrics, the number of linearly independent measurement paths must equal the number of links. Our contribution is to characterize this condition in terms of the network topology and the number/placement of monitors, under the constraint that measurement paths must be cycle-free. Our main results are: 1) it is generally impossible to identify all the link metrics by using two monitors; 2) nevertheless, metrics of all the interior links not incident to any monitor are identifiable by two monitors if the topology satisfies a set of necessary and sufficient connectivity conditions; 3) these conditions naturally extend to a necessary and sufficient condition for identifying all the link metrics using three or more monitors. We show that these conditions not only facilitate efficient identifiability tests, but also enable an efficient algorithm to place the minimum number of monitors in order to identify all link metrics. Our evaluations on both random and real topologies show that the proposed algorithm achieves identifiability using a much smaller number of monitors than a baseline solution.",
author = "Liang Ma and Ting He and Leung, {Kin K.} and Ananthram Swami and Don Towsley",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/TNET.2014.2328668",
language = "English (US)",
volume = "22",
pages = "1351--1368",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

Inferring link metrics from end-to-end path measurements : Identifiability and monitor placement. / Ma, Liang; He, Ting; Leung, Kin K.; Swami, Ananthram; Towsley, Don.

In: IEEE/ACM Transactions on Networking, Vol. 22, No. 4, 2328668, 01.01.2014, p. 1351-1368.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Inferring link metrics from end-to-end path measurements

T2 - Identifiability and monitor placement

AU - Ma, Liang

AU - He, Ting

AU - Leung, Kin K.

AU - Swami, Ananthram

AU - Towsley, Don

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We investigate the problem of identifying individual link metrics in a communication network from end-to-end path measurements, under the assumption that link metrics are additive and constant. To uniquely identify the link metrics, the number of linearly independent measurement paths must equal the number of links. Our contribution is to characterize this condition in terms of the network topology and the number/placement of monitors, under the constraint that measurement paths must be cycle-free. Our main results are: 1) it is generally impossible to identify all the link metrics by using two monitors; 2) nevertheless, metrics of all the interior links not incident to any monitor are identifiable by two monitors if the topology satisfies a set of necessary and sufficient connectivity conditions; 3) these conditions naturally extend to a necessary and sufficient condition for identifying all the link metrics using three or more monitors. We show that these conditions not only facilitate efficient identifiability tests, but also enable an efficient algorithm to place the minimum number of monitors in order to identify all link metrics. Our evaluations on both random and real topologies show that the proposed algorithm achieves identifiability using a much smaller number of monitors than a baseline solution.

AB - We investigate the problem of identifying individual link metrics in a communication network from end-to-end path measurements, under the assumption that link metrics are additive and constant. To uniquely identify the link metrics, the number of linearly independent measurement paths must equal the number of links. Our contribution is to characterize this condition in terms of the network topology and the number/placement of monitors, under the constraint that measurement paths must be cycle-free. Our main results are: 1) it is generally impossible to identify all the link metrics by using two monitors; 2) nevertheless, metrics of all the interior links not incident to any monitor are identifiable by two monitors if the topology satisfies a set of necessary and sufficient connectivity conditions; 3) these conditions naturally extend to a necessary and sufficient condition for identifying all the link metrics using three or more monitors. We show that these conditions not only facilitate efficient identifiability tests, but also enable an efficient algorithm to place the minimum number of monitors in order to identify all link metrics. Our evaluations on both random and real topologies show that the proposed algorithm achieves identifiability using a much smaller number of monitors than a baseline solution.

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

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

U2 - 10.1109/TNET.2014.2328668

DO - 10.1109/TNET.2014.2328668

M3 - Article

AN - SCOPUS:84907600008

VL - 22

SP - 1351

EP - 1368

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 4

M1 - 2328668

ER -