On network-aware clustering of Web clients
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Topology modeling via cluster graphs
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient algorithms for large-scale topology discovery
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
S3: a scalable sensing service for monitoring large networked systems
Proceedings of the 2006 SIGCOMM workshop on Internet network management
A network positioning system for the internet
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
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
Mapping and visualizing the internet
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
Practical large-scale latency estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Uncovering performance differences among backbone ISPs with Netdiff
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Internet Mapping: From Art to Science
CATCH '09 Proceedings of the 2009 Cybersecurity Applications & Technology Conference for Homeland Security
Assessing the geographic resolution of exhaustive tabulation for geolocating internet hosts
PAM'08 Proceedings of the 9th international conference on Passive and active network measurement
Improved algorithms for network topology discovery
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
| Hi-index | 0.00 |
Measuring a path performance according to one or several metrics, such as delay or bandwidth, is becoming more and more popular for applications. However, constantly probing the network is not suitable. To make measurements more scalable, the notion of clustering has emerged. In this paper, we demonstrate that clustering can limit the measurement overhead in such a context without loosing too much accuracy. We first explain that measurement reduction can be observed when vantage points collaborate and use clustering to estimate path performance. We then show, with real traces, how effective is the overhead reduction and what is the impact in term of measurement accuracy.