Reformulating the Monitor Placement Problem: Optimal Network-Wide Sampling

Gion Cantieni, Gianluca Iannaccone, Chadi Barakat, Christophe Diot, Patrick Thiran
2006 2006 40th Annual Conference on Information Sciences and Systems  
Confronted with the generalization of monitoring in operational networks, researchers have proposed placement algorithms that can help ISPs deploy their monitoring infrastructure in a cost effective way, while maximizing the benefits of their infrastructure. However, a static placement of monitors cannot be optimal given the short-term and long-term variations in traffic due to re-routing events, anomalies and the normal network evolution. In addition, most ISPs already deploy router embedded
more » ... y router embedded monitoring functionalities. Despite some limitations (inherent to being part of a router), these monitoring tools give greater visibility on the network traffic but raise the question on how to configure a network-wide monitoring infrastructure that may contain hundreds of monitoring points. Therefore, we reformulate the placement problem as follows: Given a network where all links can be monitored, which monitors should be activated and which sampling rate should be set on these monitors in order to achieve a given measurement task with high accuracy and low resource consumption? We provide a formulation of the problem, an optimal algorithm to solve it, and we study its feasibility and performance on a real backbone network.
doi:10.1109/ciss.2006.286433 fatcat:jxfjagkb7recvpoieywniy4nca