Reducing edge connectivity to vertex connectivity
ACM SIGACT News
Information Processing Letters
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
Network tomography on general topologies
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Simple network performance tomography
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Tomography-based overlay network monitoring
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
An algebraic approach to practical and scalable overlay network monitoring
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Towards deterministic network diagnosis
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Algebra-based scalable overlay network monitoring: algorithms, evaluation, and applications
IEEE/ACM Transactions on Networking (TON)
Small-delay defect detection in the presence of process variations
Microelectronics Journal
Network discovery from passive measurements
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Maintaining colored trees for disjoint multipath routing under node failures
IEEE/ACM Transactions on Networking (TON)
Single-link failure detection in all-optical networks using monitoring cycles and paths
IEEE/ACM Transactions on Networking (TON)
False data injection attacks against state estimation in electric power grids
Proceedings of the 16th ACM conference on Computer and communications security
IEEE Journal on Selected Areas in Communications
Computing the unmeasured: an algebraic approach to Internet mapping
IEEE Journal on Selected Areas in Communications
Practical Beacon Placement for Link Monitoring Using Network Tomography
IEEE Journal on Selected Areas in Communications
Inference of Link Delay in Communication Networks
IEEE Journal on Selected Areas in Communications
Identifiability of link metrics based on end-to-end path measurements
Proceedings of the 2013 conference on Internet measurement conference
| Hi-index | 0.00 |
In this paper, we study the problem of identifying constant additive link metrics using linearly independent monitoring cycles and paths. A monitoring cycle starts and ends at the same monitoring station, while a monitoring path starts and ends at distinct monitoring stations. We show that three-edge connectivity is a necessary and sufficient condition to identify link metrics using one monitoring station and employing monitoring cycles. We develop a polynomial-time algorithm to compute the set of linearly independent cycles. For networks that are less than three-edge-connected, we show how the minimum number of monitors required and their placement may be computed. For networks with symmetric directed links, we show the relationship between the number of monitors employed, the number of directed links for which metric is known a priori, and the identifiability for the remaining links. To the best of our knowledge, this is the first work that derives the necessary and sufficient conditions on the network topology for identifying additive link metrics and develops a polynomial-time algorithm to compute linearly independent cycles and paths.