Minimizing Probing Cost and Achieving Identifiability in Probe-Based Network Link Monitoring

Continuously monitoring link performance is important to network diagnosis. In this paper, we address the problem of minimizing the probing cost and achieving identifiability in probe-based network link monitoring. Given a set of links to monitor, our objective is to select the minimum number of probing paths that can uniquely determine all identifiable links and cover all unidentifiable links. We propose an algorithm based on a linear system model to find out all irreducible sets of probing paths that can uniquely determine an identifiable link, and we extend the bipartite model to reflect the relationship between a set of probing paths and an identifiable link. Since our optimization problem is NP-hard, we propose a heuristic-based algorithm to greedily select probing paths. Our method eliminates two types of redundant probing paths, i.e., those that can be replaced by others and those without any contribution to achieving identifiability. Simulations based on real network topologies show that our approach can achieve identifiability with very low probing cost. Compared with prior work, our method is more general and has better performance.

[1]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[2]  Yao Zhao,et al.  Towards unbiased end-to-end network diagnosis , 2009, TNET.

[3]  Patrick Thiran,et al.  Network loss inference with second order statistics of end-to-end flows , 2007, IMC '07.

[4]  Renata Teixeira,et al.  Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis , 2009, IEEE INFOCOM 2009.

[5]  Fei Li,et al.  End-to-End Service Quality Measurement Using Source-Routed Probes , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  Katerina J. Argyraki,et al.  Netscope: Practical Network Loss Tomography , 2010, 2010 Proceedings IEEE INFOCOM.

[7]  Marina Thottan,et al.  Distributed network monitoring with bounded link utilization in IP networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  Donald F. Towsley,et al.  Network tomography on general topologies , 2002, SIGMETRICS '02.

[9]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[10]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[11]  Golub Gene H. Et.Al.  Matrix Computations, 3rd Edition , 2007 .

[12]  Albert G. Greenberg,et al.  IP fault localization via risk modeling , 2005, NSDI.

[13]  Albert G. Greenberg,et al.  Detection and Localization of Network Black Holes , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[14]  Kamil Saraç,et al.  Analyzing Router Responsiveness to Active Measurement Probes , 2009, PAM.

[15]  Chen-Nee Chuah,et al.  Analysis of link failures in an IP backbone , 2002, IMW '02.

[16]  Paul Barford,et al.  Network Performance Anomaly Detection and Localization , 2009, IEEE INFOCOM 2009.

[17]  Avishai Wool,et al.  Computing the unmeasured: an algebraic approach to Internet mapping , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Rajeev Rastogi,et al.  Robust Monitoring of Link Delays and Faults in IP Networks , 2003, IEEE/ACM Transactions on Networking.

[19]  Ananthram Swami,et al.  Detecting and localizing large-scale router failures using active probes , 2011, 2011 - MILCOM 2011 Military Communications Conference.

[20]  Patrick Thiran,et al.  Active Measurement for Multiple Link Failures Diagnosis in IP Networks , 2004, PAM.

[21]  Donald F. Towsley,et al.  Locating network monitors: complexity, heuristics, and coverage , 2005, INFOCOM.

[22]  Vishal Misra,et al.  Toward Optimal Network Fault Correction via End-to-End Inference , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[23]  Yin Zhang,et al.  NetQuest: A Flexible Framework for Large-Scale Network Measurement , 2009, IEEE/ACM Transactions on Networking.

[24]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[25]  Rajeev Rastogi,et al.  Efficiently monitoring bandwidth and latency in IP networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[26]  Yao Zhao,et al.  Towards Efficient Large-Scale VPN Monitoring and Diagnosis under Operational Constraints , 2009, IEEE INFOCOM 2009.

[27]  Rob Sherwood,et al.  Touring the internet in a TCP sidecar , 2006, IMC '06.

[28]  Rajeev Rastogi,et al.  Diagnosing Link-Level Anomalies Using Passive Probes , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[29]  R. Rastogi,et al.  Robust Monitoring of Link Delays and Faults , 2006 .

[30]  Yueping Zhang,et al.  Optimal Probing for Unicast Network Delay Tomography , 2010, 2010 Proceedings IEEE INFOCOM.

[31]  Randy H. Katz,et al.  An algebraic approach to practical and scalable overlay network monitoring , 2004, SIGCOMM '04.

[32]  William Stallings,et al.  SNMP, SNMPv2, SNMPv3, and RMON 1 and 2 , 1999 .

[33]  Qiang Zheng,et al.  Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[34]  Kang G. Shin,et al.  Internet routing resilience to failures: analysis and implications , 2007, CoNEXT '07.

[35]  Marina Thottan,et al.  Distributed network monitoring for evolving IP networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[36]  Renata Teixeira,et al.  NetDiagnoser: troubleshooting network unreachabilities using end-to-end probes and routing data , 2007, CoNEXT '07.