A hybrid local and distributed sketching design for accurate and scalable heavy key detection in network data streams
- 1 November 2015
- journal article
- Published by Elsevier in Computer Networks
- Vol. 91, 298-315
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Sequential hashing: A flexible approach for unveiling significant patterns in high speed networksComputer Networks, 2010
- Methods for finding frequent items in data streamsThe VLDB Journal, 2009
- Probabilistic lossy countingACM SIGCOMM Computer Communication Review, 2008
- Reversible Sketches: Enabling Monitoring and Analysis Over High-Speed Data StreamsIEEE/ACM Transactions on Networking, 2007
- An improved data stream summary: the count-min sketch and its applicationsJournal of Algorithms, 2005
- Finding frequent items in data streamsTheoretical Computer Science, 2004
- New directions in traffic measurement and accountingACM Transactions on Computer Systems, 2003