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
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
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
Scheduling imprecise hard real-time jobs with cumulative error
Scheduling imprecise hard real-time jobs with cumulative error
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
An algebraic approach to practical and scalable overlay network monitoring
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
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
On the schedulability of measurement conflict in overlay networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
A case for end system multicast
IEEE Journal on Selected Areas in Communications
Mitigating interference in a network measurement service
Proceedings of the Nineteenth International Workshop on Quality of Service
| Hi-index | 0.00 |
Network monitoring is essential to the correct and efficient operation of ISP networks and the kind of applications they support, 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 leads to 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-hard, and then propose two conflict-aware scheduling algorithms for uniform and non-uniform tasks whose goal is to maximize the number of measurement tasks that can run concurrently, based on a well-known approximation algorithm. We incorporate topological information to devise a topology-aware scheduling algorithm that reduces the number of time slots required to produce a feasible measurement schedule. Also, we study the conflict-causing overlap among overlay paths using various real-life Internet topologies of the two major service carriers in the US. Experiments conducted using the PlanetLab testbed confirm that measurement conflict is a real issue that needs to be addressed. Simulation results show that our algorithms achieve at least 25% better schedulability over an existing algorithm. Finally, we discuss various practical considerations, and identify several interesting research problems in this context.