DROPS

Document

DOI: 10.4230/OASIcs.KiVS.2011.133

Distributed Probabilistic Network Traffic Measurements

Authors: Alexander Marold, Peter Lieven, and Björn Scheuermann

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

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.

Cite as

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)

Copy BibTex To Clipboard

@InProceedings{marold_et_al:OASIcs.KiVS.2011.133,
  author =	{Marold, Alexander and Lieven, Peter and Scheuermann, Bj\"{o}rn},
  title =	{{Distributed Probabilistic Network Traffic Measurements}},
  booktitle =	{17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
  pages =	{133--144},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-27-9},
  ISSN =	{2190-6807},
  year =	{2011},
  volume =	{17},
  editor =	{Luttenberger, Norbert and Peters, Hagen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.133},
  URN =		{urn:nbn:de:0030-drops-29648},
  doi =		{10.4230/OASIcs.KiVS.2011.133},
  annote =	{Keywords: network measurement, flow monitoring, probabilistic techniques}
}

Search Results

Documents authored by Marold, Alexander

Distributed Probabilistic Network Traffic Measurements

Abstract

Cite as

Thanks for your feedback!

Could not send message