… We studied the problem of maximal identifiability monitor placement in network tomography,
for which we developed an efficient greedy algorithm that incrementally places monitors to …

… paths between monitors. Our goal is robust monitor placement, ie, the same set of monitors
can maintain network identifiability under topology changes. Our main contribution is a set of …

… incrementally selects monitors to optimize … of monitors required by the other probing
mechanisms. In the special case of single-node failures, we develop an improved monitor placement …

… , it is desirable to have a monitor placement strategy that can handle topology changes … to
develop monitor placement algorithms that are robust to topology changes. In many networks, …

… to monitor all network edges. We show that the latter problem is NP-complete and use various
approximate placement … is the set of edges to be monitored. Beacon set computations for …

… monitor all network edges. We show that the latter problem is NP-complete and use an
approximate placement … is the set of edges to be monitored. Beacon set computations for several …

… a given monitor placement in G if it is still identifiable for the same monitor placement in all
… The network G is k-identifiable if all links in G are k-identifiable. It is worth noting that a (k+1)-…

… nature of 5G networks. Network tomography (NT) is an emerging monitoring approach
that estimates network performance based on measurements realized at a limited subset of …

… The goal of Boolean network tomography is essentially to … network settings such as topology,
monitor placement, and … problems: In a network with any given monitor placement, (1) if the …

… We propose a set of robust monitor placement algorithms with different performance-… this
tomography problem. In particular, we show that the optimal (ie, minimum) monitor placement is …