CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Revealing Hidden Hierarchical Heavy Hitters in network traffic
Authors
G Antichi
G Bianchi
+3 more
R Bifulco
S Galea
AW Moore
Publication date
1 January 2018
Publisher
SIGCOMM 2018 - Proceedings of the 2018 Posters and Demos, Part of SIGCOMM 2018
Doi
Cite
Abstract
© 2018 Association for Computing Machinery. The idea to enable advanced in-network monitoring functionality has been lately fostered by the advent of massive data-plane programmability. A specific example includes the detection of traffic aggregates with programmable switches, i.e., heavy hitters. So far, proposed solutions implement the mining process by partitioning the network stream in disjoint windows. This practice allows efficient implementations but comes at a well-known cost: the results are tightly coupled with the traffic and window's characteristics. This poster quantifies the limitations of disjoint time windows approaches by showing that they hardly cope with traffic dynamics. We report the results of our analysis and unveil that up to 34% of the total number of the hierarchical heavy hitters might not be detected with those approaches. This is a call for a new set of windowless-based algorithms to be implemented with the match-action paradigm
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Sustaining member
Apollo (Cambridge)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:www.repository.cam.ac.uk:1...
Last time updated on 22/09/2020
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 10/08/2021