Liang Ma

TL;DR: An algorithm is developed that can construct u linearly independent, cycle-free paths between monitors without examining all candidate paths, whose complexity is quadratic in u, and which satisfies a nested structure that allows linear-time computation of link metrics without explicitly inverting the measurement matrix.

TL;DR: It is observed that despite a higher implementation cost, probing along controllable paths can significantly improve a network's capability to localize simultaneous node failures, and the maximal identifiability of node failures is bound.

TL;DR: This work 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, and shows that these conditions not only allow efficient identifiability tests, but also enable an efficient algorithm to place the minimum number of monitors in order to identify all link metrics.

TL;DR: This work describes the problem of identifying individual link metrics in a communication network from end-to-end path measurements in terms of the network topology and the number/placement of monitors, under the constraint that measurement paths must be cycle-free.

TL;DR: The problem of placing a given number of monitors in a communication network to identify the maximum number of link metrics from end-to-end measurements between monitors is investigated, assuming that link metrics are additive, and measurement paths cannot contain cycles.