|
|
|
High-Speed Per-Flow Traffic Measurement with Probabilistic Multiplicity Counting
|
Author(s):
|
Peter Lieven, Björn Scheuermann.
|
|
Title:
|
High-Speed Per-Flow Traffic Measurement with Probabilistic Multiplicity Counting
|
|
Published:
|
INFOCOM 2010: Proceedings of the 29th IEEE International Conference on Computer Communications,
San Diego, CA, USA,
March 2010
|
|
Keyword(s):
|
|
|
Abstract:
|
On today's high-speed backbone network links, measuring per-flow traffic information has become very challenging. Maintaining exact per-flow packet counters on OC-192 or OC-768 links is not practically feasible due to computational and cost constrains. Packet sampling as implemented in today's routers results in large approximation errors. Here, we present Probabilistic Multiplicity Counting (PMC), a novel data structure that is capable of accounting traffic per flow probabilistically. The PMC algorithm is very simple and highly parallelizable, and therefore allows for efficient implementations in software and hardware. At the same time, it provides very accurate traffic statistics. We evaluate PMC with both artificial and real-world traffic data, demonstrating that it outperforms other approaches.
|
|
Note:
|
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.
|
|
Bib entry:
|
[XML]
[BibTeX]
|
|
Download:
|
[PDF]
|
|
|
