IEEE Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice

These are the authors' versions of the work. The copyright is with ACM. They are posted here by permission of ACM for your personal use. Not for redistribution. See individual publication details for information on the publication of the definitive versions.

Springer-Verlag LNCS Copyright Notice

The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.

Work that appeared before the 1st of September 2003 was published while the authors were with the Lehrstuhl Praktische Informatik IV at the University of Mannheim.

Probabilistic Parallel Measurement of Network Traffic at Multiple Locations

Author(s): Alexander Marold, Peter Lieven, Björn Scheuermann.
Title: Probabilistic Parallel Measurement of Network Traffic at Multiple Locations
Published: IEEE Network (), 2011
Abstract: Measuring the per-flow traffic in large networks is very challenging due to the high performancerequirements. In addition to that, if traffic is measured at multiple points in the network at the sametime, it becomes necessary to merge the observations in order to obtain network-wide statistics. Whendoing so, packets must be accounted for only once, even if they traversed more than one measurementpoint. Today's standard technique, sampling-based traffic accounting, results in large approximationerrors. Here, we describe an approach named Distributed Probabilistic Counting (DPC). DPC is basedon a probabilistic data representation. It provides accurate traffic statistics at very low per-packet effort,and is able to merge measurement from multiple network locations while counting each distinct packetonly once.
Note: in press
Bib entry: [XML] [BibTeX]
Verantwortlich für den Inhalt: E-Mail sendenWE Informatik