Filters








594 Hits in 3.4 sec

Online heavy hitter detector on FPGA

Da Tong, Viktor Prasanna
2013 2013 International Conference on Reconfigurable Computing and FPGAs (ReConFig)  
The proposed architecture can support large number of concurrent flows using external memory while sustaining the same throughput as the on-chip BRAM based implementation.  ...  In this work, we propose a pipelined architecture for an online heavy hitter detector on FPGA. It also reports the top K heavy hitters.  ...  1: Sort the reported heavy hitters B.  ... 
doi:10.1109/reconfig.2013.6732297 dblp:conf/reconfig/TongP13 fatcat:rdifnekn4rgmllhc5z757ijqci

The Online Event-Detection Problem [article]

Michael A. Bender, Jonathan W. Berry, Martin Farach-Colton, Rob Johnson, Thomas M. Kroeger, Prashant Pandey, Cynthia A. Phillips, Shikha Singh
2018 arXiv   pre-print
., s_N), a ϕ-heavy hitter is an item s_i that occurs at least ϕ N times in S. The problem of finding heavy-hitters has been extensively studied in the database literature.  ...  Since OEDP requires large space, we focus on cache-efficient algorithms in the external-memory model. We provide algorithms for the OEDP that are within a log factor of optimal.  ...  Acknowledgments We would like to thank Tyler Mayer for many helpful discussions in earlier stages of this project.  ... 
arXiv:1812.09824v1 fatcat:mu5a3abopvdofnwhj7rgw3k44a

Mining Discriminative K-mers in DNA Sequences Using Sketches and Hardware Acceleration

Antonio Saavedra, Hans Lehnert, Cecilia Hernandez, Gonzalo Carvajal, Miguel Figueroa
2020 IEEE Access  
, and requires at least five times less memory when processing large datasets.  ...  INDEX TERMS Discriminative k-mers, heavy hitters, counting sketches, parallel processing, hardware acceleration, field-programmable gate arrays.  ...  The accelerator uses a heavy-hitter buffer of 1,024 slots (see Section V-B3), implemented as a 4-way set-associate memory of 256 sets (M = 256, K = 4).  ... 
doi:10.1109/access.2020.3003918 fatcat:zuxcxgfamzfvrdqnjsyntyzggq

A Fast and Compact Invertible Sketch for Network-Wide Heavy Flow Detection [article]

Lu Tang, Qun Huang, Patrick P. C. Lee
2020 arXiv   pre-print
Fast detection of heavy flows (e.g., heavy hitters and heavy changers) in massive network traffic is challenging due to the stringent requirements of fast packet processing and limited resource availability  ...  MV-Sketch tracks candidate heavy flows inside the sketch data structure via the idea of majority voting, such that it incurs small memory access overhead in both update and query operations, while achieving  ...  In the interest of space, we focus on heavy hitter detection using a single sketch.  ... 
arXiv:1910.10441v2 fatcat:q5yrfpi3qna7nhpeqlbnddg53a

Seek and Push: Detecting Large Traffic Aggregates in the Dataplane [article]

Jan Kučera, Diana Andreea Popescu, Gianni Antichi, Jan Kořenek, Andrew W. Moore
2018 arXiv   pre-print
We report and discuss an evaluation of our P4-based prototype, showing our solution to be able to detect (with 95% of precision), hierarchical heavy hitters and superspreaders using less than 8KB or 80KB  ...  of active memory respectively.  ...  Dividing the time in fixed intervals can simplify the detection of a number of network events, e.g., heavy hitter, superspreader, DDoS.  ... 
arXiv:1805.05993v1 fatcat:o7z6vng6efbx5mtxte7ajmi5f4

An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors [article]

Joshua Allen, Bolin Ding, Janardhan Kulkarni, Harsha Nori, Olga Ohrimenko, Sergey Yekhanin
2019 arXiv   pre-print
In contrast, applications of differential privacy in commercial systems by Apple, Google, and Microsoft, use the local model.  ...  In this work, we propose a framework based on trusted processors and a new definition of differential privacy called Oblivious Differential Privacy, which combines the best of both local and global models  ...  , histogram of the elements, and reporting heavy hitters.  ... 
arXiv:1807.00736v2 fatcat:dyoheafz2vhrvootoagmwa5xyi

Run-Time System for Scalable Network Services

U. Shevade, R. Kokku, H. M. Vin
2008 2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications  
To support highthroughput, these services are often deployed on Distributed Memory, Multi-processor (DM-MP) hardware platforms such as a cluster of network processors.  ...  In this paper, we describe the design and implementation of Oboe, a run-time system for DM-MP platforms that addresses the above challenge through two foundations: (1) categoryspecific management of shared  ...  Heavy hitters are detected using sketches [10] and added to a table that stores their arrival rate and PE mapping.  ... 
doi:10.1109/infocom.2007.244 fatcat:stiqj34gdfazpjd7uurgsgpj5u

Run-Time System for Scalable Network Services

U. Shevade, R. Kokku, H. M. Vin
2008 IEEE INFOCOM 2008 - The 27th Conference on Computer Communications  
To support highthroughput, these services are often deployed on Distributed Memory, Multi-processor (DM-MP) hardware platforms such as a cluster of network processors.  ...  In this paper, we describe the design and implementation of Oboe, a run-time system for DM-MP platforms that addresses the above challenge through two foundations: (1) categoryspecific management of shared  ...  Heavy hitters are detected using sketches [10] and added to a table that stores their arrival rate and PE mapping.  ... 
doi:10.1109/infocom.2008.244 dblp:conf/infocom/ShevadeKV08 fatcat:brwk5mpnfberrnbfzhg5f2xmly

Adaptive Aggregation of Flow Records

Adrián Pekár, Martin Chovanec, Liberios Vokorokos, Eva Chovancová, Peter Feciľak, Miroslav Michalko
2018 Computing and informatics  
Since the accurate knowledge of flows termed as "heavy-hitters" suffices to fulfill most of the monitoring purposes, we decided to aggregate the flow records pertaining to non-heavy-hitters.  ...  This paper explores the problem of processing the immense volume of measurement data arising during network traffic monitoring.  ...  Acknowledgments This publication is the result of the Project implementation: University Science Park TECHNICOM for Innovation Applications Supported by Knowledge Technology, ITMS: 26220220182, supported  ... 
doi:10.4149/cai_2018_1_142 fatcat:vzvsrfcgbzbvxc2hrly4q4o2j4

Towards automated performance diagnosis in a large IPTV network

Ajay Anil Mahimkar, Zihui Ge, Aman Shaikh, Jia Wang, Jennifer Yates, Yin Zhang, Qi Zhao
2009 Proceedings of the ACM SIGCOMM 2009 conference on Data communication - SIGCOMM '09  
performance, (iii) has different distribution protocols (which make heavy use of IP multicast) and traffic patterns, and (iv) faces more serious scalability challenges in managing millions of network  ...  The methodology and algorithms in Giza promise to be of great use in IPTV network operations.  ...  We are also grateful to the network operations and customer support teams of the anonymous IPTV service provider for their kind help on the data collection and the case study analysis.  ... 
doi:10.1145/1592568.1592596 dblp:conf/sigcomm/MahimkarGSWYZZ09 fatcat:fq6jihnolzf7nfmgps5qatuwbq

Towards automated performance diagnosis in a large IPTV network

Ajay Anil Mahimkar, Zihui Ge, Aman Shaikh, Jia Wang, Jennifer Yates, Yin Zhang, Qi Zhao
2009 Computer communication review  
performance, (iii) has different distribution protocols (which make heavy use of IP multicast) and traffic patterns, and (iv) faces more serious scalability challenges in managing millions of network  ...  The methodology and algorithms in Giza promise to be of great use in IPTV network operations.  ...  We are also grateful to the network operations and customer support teams of the anonymous IPTV service provider for their kind help on the data collection and the case study analysis.  ... 
doi:10.1145/1594977.1592596 fatcat:r2g2ppcnuvbgvdhtxtv6wj4r6i

Indexing for summary queries

Ke Yi, Lu Wang, Zhewei Wei
2014 ACM Transactions on Database Systems  
A heavy hitters summary of size O(1/ε) can be constructed in one pass over D, using the MG algorithm [Misra and Gries 1982] or the SpaceSaving algorithm [Metwally et al. 2006 ]. Quantiles.  ...  Next we review some of the most fundamental and most studied summaries in the literature. Let D be a bag of items, and let f D (x) be the frequency of x in D. Heavy Hitters.  ...  This way, an aggregation query can be answered in O(log N) time (O(log B N) I/Os in external memory).  ... 
doi:10.1145/2508702 fatcat:nufgsoboqzamjmv2uaq7btyyk4

Heavy Hitters via Cluster-Preserving Clustering

Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup
2016 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)  
Upon receiving a query, the goal is to report every "heavy hitter" i ∈ [n] with |x i | ≥ ε x p as part of a list L ⊆ [n] of size O(1/ε p ), i.e. proportional to the maximum possible number of heavy hitters  ...  For any p ∈ (0, 2] the CountSketch of [CCFC04] solves p heavy hitters using O(ε −p lg n) words of space with O(lg n) update time, O(n lg n) query time to output L, and whose output after any query is correct  ...  Acknowledgments We thank Noga Alon for pointing us to [AC88, Lemma 2.3], Jonathan Kelner for the reference [OSV12] , Lorenzo Orecchia and Sushant Sachdeva for answering several questions about [OV11,  ... 
doi:10.1109/focs.2016.16 dblp:conf/focs/LarsenNNT16 fatcat:os3kmivc2vcvlheht5bogeifye

Heavy hitters via cluster-preserving clustering [article]

Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup
2016 arXiv   pre-print
For any p∈(0,2] the CountSketch solves ℓ_p heavy hitters using O(ε^-p n) words of space with O( n) update time, O(n n) query time to output L, and whose output after any query is correct with high probability  ...  Our main innovation is an efficient reduction from the heavy hitters to a clustering problem in which each heavy hitter is encoded as some form of noisy spectral cluster in a much bigger graph, and the  ...  Acknowledgments We thank Noga Alon for pointing us to [AC88, Lemma 2.3], Jonathan Kelner for the reference [OSV12] , Lorenzo Orecchia and Sushant Sachdeva for answering several questions about [OV11,  ... 
arXiv:1604.01357v1 fatcat:hhpqcpbhyzbpjlia2ws3peqjmu

Scalable online first-order monitoring

Joshua Schneider, David Basin, Frederik Brix, Srđan Krstić, Dmitriy Traytel
2021 International Journal on Software Tools for Technology Transfer (STTT)  
Existing state-of-the-art monitors for first-order patterns, which may refer to and quantify over data values, can process streams of modest velocity in real-time.  ...  AbstractOnline monitoring is the task of identifying complex temporal patterns while incrementally processing streams of data-carrying events.  ...  We also measure the execution time and maximal memory usage of each submonitor.  ... 
doi:10.1007/s10009-021-00607-1 fatcat:uxlpc3zy6ncclntqfdjdlz7u6i
« Previous Showing results 1 — 15 out of 594 results