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. © IFIP International Federation for Information Processing 2009.
CITATION STYLE
Saucez, D., Donnet, B., & Bonaventure, O. (2009). On the impact of clustering on measurement reduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5550 LNCS, pp. 835–846). https://doi.org/10.1007/978-3-642-01399-7_65
Mendeley helps you to discover research relevant for your work.