Optimal Deployment of Distributed Passive Measurement Monitors

Flow-level traffic measurement is important for network management. The widely used centralized per-flow measurement faces a great challenge due to the demanding requirement on both memory bandwidth and memory size within a single traffic monitor. This paper addresses the issue of deploying a Distributed Passive Measurement System (DPMS) in a large scale network; specifically, we study how to optimally place traffic monitors and sample stochastic traffic flows, so that the probability of a packet being sampled (a.k.a. measurement coverage) is maximized. We formulate this problem as a Stochastic Chance Constrained Optimization (SCCO) problem; and we propose a Hybrid Intelligent (HI) algorithm to solve this problem. The HI algorithm consists of two major components, namely, uncertain function approximation and genetic algorithm. Equipped with the HI algorithm, we are able to address the optimal tradeoff between measurement coverage and deployment cost for networks with random traffic, which has not been studied before. Our simulations and experiments demonstrate the effectiveness of our algorithm, i.e., a small deployment cost or a small number of monitors are sufficient to maintain a high level of measurement coverage.

[1]  George Varghese,et al.  Building a better NetFlow , 2004, SIGCOMM.

[2]  Abhishek Kumar,et al.  Space-code bloom filter for efficient traffic flow measurement , 2003, IMC '03.

[3]  Dana S. Richards,et al.  Punctuated Equilibria: A Parallel Genetic Algorithm , 1987, ICGA.

[4]  Christophe Diot,et al.  Geographical and temporal characteristics of inter-POP flows: View from a single pop , 2002, Eur. Trans. Telecommun..

[5]  Kavé Salamatian,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM '02.

[6]  Philippe Owezarski,et al.  Design and Deployment of a Passive Monitoring Infrastructure , 2001, IWDC.

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[9]  George Varghese,et al.  New directions in traffic measurement and accounting , 2002, CCRV.

[10]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[11]  Colin R. Reeves,et al.  Genetic Algorithms: Principles and Perspectives: A Guide to Ga Theory , 2002 .

[12]  Donald F. Towsley,et al.  Locating network monitors: complexity, heuristics, and coverage , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[13]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[14]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.