Greed is good: approximating independent sets in sparse and bounded-degree graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Backup Path Allocation Based on a Correlated Link Failure Probability Model in Overlay Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Synchronizing Network Probes to avoid Measurement Intrusiveness with the Network Weather Service
HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
A measurement study of available bandwidth estimation tools
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
On the Cost-Quality Tradeoff in Topology-Aware Overlay Path Probing
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Ontimemeasure: a scalable framework for scheduling active measurements
E2EMON '05 Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop
Link stress reduction in topology-aware overlay path monitoring
Computer Communications
Scheduling algorithms for conducting conflict-free measurements in overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Network monitoring is essential to the correct and efficient operation of overlay networks, and active measurement is a key design problem in network monitoring. Unfortunately, almost all active probing algorithms ignore the measurement conflict problem: Active measurements conflict with each other - due to the nature of these measurements, the associated overhead, and the network topology - which results in reporting incorrect results. In this paper, we consider the problem of scheduling periodic QoS measurement tasks in overlay networks. We first show that this problem is NP-complete, and then propose a conflict-aware scheduling algorithm whose goal is to maximize the number of measurement tasks that can run concurrently, based on a well known approximation algorithm. Simulation results show that our algorithm achieves 25% better schedulability over the existing algorithm. Finally, we discuss various practical considerations, and identify several interesting research problems in this context.