Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 3 - Monitor Placement for Additive Network Tomography

  • Ting He, Pennsylvania State University, Liang Ma, Ananthram Swami, Don Towsley, University of Massachusetts, Amherst
  • Book:
    Network Tomography
    Published online:
    25 May 2021
    Print publication:
    27 May 2021, pp 43-77

  • Summary

    Based on the conditions for identifying additive link metrics presented in Chapter 2, this chapter addresses two network design questions: (1) Given an unbounded number of monitors, where should they be placed in the network to identify the metrics of all the links using a minimum number of monitors? (2) Given a bounded number of monitors, where should they be placed in the network to identify the metrics of the largest subset of links? The focus here is on the design of intelligent algorithms that can efficiently compute the optimal monitor locations without enumerating all possible monitor placements, achieved through strategic decomposition of the network topology based on the required identifiability conditions. Variations of these algorithms are also given to address cases with predictable or unpredictable topology changes and limited links of interest. In addition to theoretical analysis, empirical results are given to demonstrate the capability of selected algorithms for which such results are available.