Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
The budgeted maximum coverage problem
Information Processing Letters
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Experiences With Monitoring OSPF on a Regional Service Provider Network
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
DIMES: let the internet measure itself
ACM SIGCOMM Computer Communication Review
Avoiding traceroute anomalies with Paris traceroute
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
OSPF monitoring: architecture, design and deployment experience
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
The Generalized Maximum Coverage Problem
Information Processing Letters
PerfSONAR: a service oriented architecture for multi-domain network monitoring
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
Hi-index | 0.00 |
Internet Service Provider (ISPs) need to measure large-scale end-to-end network performance for the purpose of monitoring customers' performance and providing network devices efficiently. This paper proposes, an IP performance measurement infrastructure that utilizes users' PCs as beacons. Probing packets are sent and received among the beacons under the control of a central server. The central server calculates the set of measurement paths that maximizes network coverage under constraints of users' PCs. The infrastructure is experimentally implemented and evaluated through simulation and real-world experiments and its considerable potential for practical network operations is demonstrated.