Optimal positioning of active and passive monitoring devices

Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific devices to links in order to monitor the traffic that passes through the network and the active approach that generates explicit control packets in the network for measurements. One of the key issues in this domain is to minimize the overhead in terms of hardware, software, maintenance cost and additional traffic.In this paper, we study the problem of assigning tap devices for passive monitoring and beacons for active monitoring. Minimizing the number of devices and finding optimal strategic locations is a key issue, mandatory for deploying scalable monitoring platforms. In this article, we present a combinatorial view of the problem from which we derive complexity and approximability results, as well as efficient and versatile Mixed Integer Programming (MIP) formulations.

[1]  Georg Carle,et al.  Requirements for {IP} Flow Information Export , 2001 .

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

[3]  Lixia Zhang,et al.  On the placement of Internet instrumentation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  Alejandro López-Ortiz,et al.  On the number of distributed measurement points for network tomography , 2003, IMC '03.

[6]  Shigeki Goto,et al.  Identifying elephant flows through periodically sampled packets , 2004, IMC '04.

[7]  Stefan Savage,et al.  Inferring Internet denial-of-service activity , 2001, TOCS.

[8]  Peter Slavík.  A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.

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

[10]  Murali S. Kodialam,et al.  Detecting network intrusions via sampling: a game theoretic approach , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  Vern Paxson,et al.  Framework for IP Performance Metrics , 1998, RFC.

[12]  Carsten Lund,et al.  Estimating flow distributions from sampled flow statistics , 2003, SIGCOMM '03.

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

[14]  Guy Kortsarz,et al.  On network design problems: fixed cost flows and the covering steiner problem , 2002, TALG.

[15]  Jürgen Quittek,et al.  Requirements for IP Flow Information Export (IPFIX) , 2004, RFC.

[16]  Donald F. Towsley,et al.  Inferring TCP connection characteristics through passive measurements , 2004, IEEE INFOCOM 2004.

[17]  Christophe Diot,et al.  Pop-level and access-link-level traffic dynamics in a tier-1 POP , 2001, IMW '01.

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

[19]  Nick Duffield,et al.  Sampling for Passive Internet Measurement: A Review , 2004 .

[20]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[21]  Vern Paxson,et al.  Experiences with NIMI , 2002, Proceedings 2002 Symposium on Applications and the Internet (SAINT) Workshops.

[22]  Petr Slavík.  Improved Performance of the Greedy Algorithm for Partial Cover , 1997, Inf. Process. Lett..