Scheduling file transfers in a distributed network
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A probabilistic analysis of multidimensional bin packing problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A measurement study of available bandwidth estimation tools
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Packet-dispersion techniques and a capacity-estimation methodology
IEEE/ACM Transactions on Networking (TON)
Using PlanetLab for network research: myths, realities, and best practices
ACM SIGOPS Operating Systems Review
S3: a scalable sensing service for monitoring large networked systems
Proceedings of the 2006 SIGCOMM workshop on Internet network management
Exploiting internet route sharing for large scale available bandwidth estimation
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Magellan: Charting Large-Scale Peer-to-Peer Live Streaming Topologies
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Orchestration of Network-Wide Active Measurements for Supporting Distributed Computing Applications
IEEE Transactions on Computers
Discarte: a disjunctive internet cartographer
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Scheduling algorithms for conducting conflict-free measurements in overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Lattice: Multivariate Data Visualization with R
Lattice: Multivariate Data Visualization with R
The quest for bandwidth estimation techniques for large-scale distributed systems
ACM SIGMETRICS Performance Evaluation Review
On the Cost of Network Inference Mechanisms
IEEE Transactions on Parallel and Distributed Systems
The capacity of wireless networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Shared measurement services offer key advantages over conventional ad-hoc techniques for network monitoring. A measurement service may receive measurement requests concurrently from different applications and network administrators. These measurement requests are often served by injecting active network measurement traffic between two hosts. Two active measurements are said to interfere when the probe packets of one measurement tool are viewed as network traffic by the other. This may lead to faulty measurement readings. In this paper, we model the measurement interference problem, and show how to schedule measurement tasks to reduce interference and hence increase measurement accuracy. We propose twelve computationally tractable algorithms that decrease the total completion time (makespan) of measurement tasks, while avoiding interference. Our evaluation shows that the algorithm we refer to as Largest Area First, Busiest Node First - Earliest Interval Schedule (LAFBNF-EIS) has a mean makespan of about 5% more than the theoretical lower bound over our set of measurement workloads.