A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the marginal utility of network topology measurements
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Hardness results for approximate hypergraph coloring
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Robust monitoring of link delays and faults in IP networks
IEEE/ACM Transactions on Networking (TON)
NetDiagnoser: troubleshooting network unreachabilities using end-to-end probes and routing data
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Path Hitting in Acyclic Graphs
Algorithmica
NetQuest: a flexible framework for large-scale network measurement
IEEE/ACM Transactions on Networking (TON)
The Weighted Coupon Collector's Problem and Applications
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Multiobjective monitoring for SLA compliance
IEEE/ACM Transactions on Networking (TON)
Enabling flow-level latency measurements across routers in data centers
Hot-ICE'11 Proceedings of the 11th USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services
Strong colorings of hypergraphs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
Network Tomography of Binary Network Performance Characteristics
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We present a framework for the design and analysis of probing methods to monitor network performance, an important technique for collecting measurements in tasks such as fault detection. We use this framework to study the interaction among numerous, possibly conflicting, optimization goals in the design of a probing algorithm. We present a rigorous definition of a probing-algorithm design problem that can apply broadly to network-measurement scenarios. We also present several metrics relevant to the analysis of probing algorithms, including probing frequency and network coverage, communication and computational overhead, and the amount of algorithm state required. We show inherent tradeoffs among optimization goals and give hardness results for achieving some combinations of optimization goals. We also consider the possibility of developing approximation algorithms for achieving some of the goals and describe a randomized approach as an alternative, evaluating it using our framework. Our work aids future development of low-overhead probing techniques and introduces principles from IP-based networking to theoretically grounded approaches for concurrent path-selection problems.