Document Open Access Logo

Distributed Probabilistic Network Traffic Measurements

Authors Alexander Marold, Peter Lieven, Björn Scheuermann



PDF
Thumbnail PDF

File

OASIcs.KiVS.2011.133.pdf
  • Filesize: 1.31 MB
  • 12 pages

Document Identifiers

Author Details

Alexander Marold
Peter Lieven
Björn Scheuermann

Cite AsGet BibTex

Alexander Marold, Peter Lieven, and Björn Scheuermann. Distributed Probabilistic Network Traffic Measurements. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 133-144, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/OASIcs.KiVS.2011.133

Abstract

Measuring the per-flow traffic in large networks is very challenging due to the high performance requirements on the one hand, and due to the necessity to merge locally recorded data from multiple routers in order to obtain network-wide statistics on the other hand. The latter is nontrivial because traffic that traversed more than one measurement point must only be counted once, which requires duplicate-insensitive distributed counting mechanisms. Sampling-based traffic accounting as implemented in today’s routers results in large approximation errors, and does not allow for merging information from multiple points in the network into network-wide total traffic statistics. Here, we present Distributed Probabilistic Counting (DPC), an algorithm to obtain duplicate-insensitive distributed per-flow traffic statistics based on a probabilistic counting technique. DPC is structurally simple, very fast, and highly parallelizable, and therefore allows for efficient implementations in software and hardware. At the same time it provides very accurate traffic statistics, as we demonstrate based on both artificial and real-world traffic data.
Keywords
  • network measurement
  • flow monitoring
  • probabilistic techniques

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail