Filters








62,156 Hits in 6.6 sec

SCREAM

Masoud Moshref, Minlan Yu, Ramesh Govindan, Amin Vahdat
2015 Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies - CoNEXT '15  
This paper presents SCREAM, a system for allocating resources to sketch-based measurement tasks that ensures a user-specified minimum accuracy.  ...  Recently, there have been many proposals for using sketches for network measurement.  ...  ACKNOWLEDGEMENTS We thank our shepherd Laurent Mathy and CoNEXT reviewers for their helpful feedback.  ... 
doi:10.1145/2716281.2836099 dblp:conf/conext/MoshrefYGV15 fatcat:gxop4lj6zbgn5hlrbt55cshyuu

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
Invertible sketches are summary data structures that can recover heavy flows with small memory footprints and bounded errors, yet existing invertible sketches incur high memory access overhead that leads  ...  Furthermore, we evaluate MV-Sketch on a Barefoot Tofino switch and show how MV-Sketch achieves line-rate measurement with limited hardware resource overhead.  ...  based on estimated flow sizes.  ... 
arXiv:1910.10441v2 fatcat:q5yrfpi3qna7nhpeqlbnddg53a

Towards a Universal Sketch for Origin-Destination Network Measurements [chapter]

Haiquan Zhao, Nan Hua, Ashwin Lall, Ping Li, Jia Wang, Jun Xu
2011 Lecture Notes in Computer Science  
We show that the CRS sketch can compute unbiased estimates for any linear summary statistic in the intersection of a pair of traffic streams, e.g., traffic and flow matrix information, flow counts, and  ...  Despite its importance in today's Internet, network measurement was not an integral part of the original Internet architecture, i.e., there was (and still is) little native support for many essential measurement  ...  For most of the common measurement statistics that we estimated, it gave low measurement error while using memory comparable with a specialized algorithm for any single statistic.  ... 
doi:10.1007/978-3-642-24403-2_17 fatcat:rxrbmouaqrguzjhwqoc2n3myq4

Highly compact virtual maximum likelihood sketches for counting big network data

Zhen Mo, Yan Qiao, Shigang Chen, Tao Li
2014 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
As the Internet moves into the era of big network data, it presents both opportunities and technical challenges for traffic measurement functions, such as flow cardinality estimation, which is to estimate  ...  We also consider the problem of differentiated estimation that gives flows of high priorities better precision in their cardinality estimations.  ...  A more direct comparison is given in Figure 7 , which shows that the standard errors for high-priority flows are about half of the errors for the base-priority flows when the flow cardinalities are beyond  ... 
doi:10.1109/allerton.2014.7028590 dblp:conf/allerton/MoQCL14 fatcat:tsla3ykodbcbpgtpc67qzzm5x4

Faster and More Accurate Measurement through Additive-Error Counters [article]

Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, Shay Vargaftik
2020 arXiv   pre-print
Instead, we propose additive error estimators, which are simpler, faster, and more accurate when used for network measurement.  ...  Counters are a fundamental building block for networking applications such as load balancing, traffic engineering, and intrusion detection, which require estimating flow sizes and identifying heavy hitter  ...  Then, as the Memory increases, the precision of the estimator based sketches stops improving while that of the Baseline improves further.  ... 
arXiv:2004.10332v1 fatcat:yrkblns7efgpjcatkg65vsf6i4

Jellyfish: Locality-Sensitive Subflow Sketching

Yongquan Fu, Lun An, Siqi Shen, Kai Chen, Pere Barlet-Ros
2021 IEEE INFOCOM 2021 - IEEE Conference on Computer Communications  
Realworld trace-driven experiments show that Jellyfish reduces the average estimation errors by up to six orders of magnitude for per-flow queries, by six orders of magnitude for entropy queries, and up  ...  We present Jellyfish, a locality-sensitive sketching framework to address these issues. Jellyfish goes beyond network flow-based sketching towards fragments of network flows called subflows.  ...  , which need a variety of measurement tasks, such as delay, flow size estimation, flow distribution, and heavy hitter detection.  ... 
doi:10.1109/infocom42981.2021.9488847 fatcat:ksawd4mlqjf7vc6dfxinfr4xtm

Count-Less: A Counting Sketch for the Data Plane of High Speed Switches [article]

SunYoung Kim, Changhun Jung, RhongHo Jang, David Mohaisen, DaeHun Nyang
2021 arXiv   pre-print
which gives us a room for better estimation.  ...  Measuring flows with exact counting is infeasible due to processing and memory constraints, but a sketch is a promising candidate for collecting approximately per-flow statistics in data plane in real-time  ...  However, we note that Elastic sketch was designed to estimate the source IP-based flows (i.e., 32-bit label).  ... 
arXiv:2111.02759v1 fatcat:75a3r2hvxzaplkfbop3pcstxle

Computational Experience on Advanced Algorithms for User Equilibrium Traffic Assignment Problem and Its Convergence Error

Shin-ichi Inoue, Takuya Maruyama
2012 Procedia - Social and Behavioral Sciences  
This means that the convergence error of a link flow can possibly be estimated from the duality gap.  ...  We found that the difference between the temporal and exact solutions for the link flow (i.e., convergence error of the link flow) is nearly proportional to the duality gap of the mathematical optimization  ...  Hillel Bar-Gera for their interest in our study and for recommending that we publish our computational experiences.  ... 
doi:10.1016/j.sbspro.2012.04.118 fatcat:drv43sxcbnewhlfnayh2ugsyf4

A survey of sketches in traffic measurement: Design, Optimization, Application and Implementation [article]

Shangsen Li, Lailong Luo, Deke Guo, Qianzhen Zhang, Pengtao Fu
2021 arXiv   pre-print
Finally,we highlight the open issues for future sketch-based network measurement research.  ...  Due to the massive, speedy, unpredictable features of network flows, sketches are widely implemented in measurement nodes to approximately record the frequency or estimate the cardinality of flows.  ...  expected error can be rather precisely controlled.  ... 
arXiv:2012.07214v2 fatcat:lme2ghsshje3tag2m5q3xgvcna

ExtendedSketch: Fusing Network Traffic for Super Host Identification with a Memory Efficient Sketch

Xuyang Jing, Zheng Yan, Hui Han, Witold Pedrycz
2021 IEEE Transactions on Dependable and Secure Computing  
Setting an inappropriate counter size for a sketch could either lead to inaccurate host cardinality estimation or cause memory waste.  ...  However, most sketches cannot flexibly balance memory usage and accuracy in host cardinality estimation.  ...  For (SDN) can measure flow size/cardinality by using flow tables.  ... 
doi:10.1109/tdsc.2021.3111328 fatcat:7th3jxve4bctxaibjn7mgpd4ue

Leveraging Active Decremental TTL Measuring for Flexible and Efficient NAT identification

Tao Yang, Chengyu Wang, Tongqing Zhou, Zhiping Cai, Kui Wu, Bingnan Hou
2022 Computers Materials & Continua  
In this paper, we propose a flexible and efficient network address translation identification scheme based on actively measuring the distance of a round trip to a target with decremental time-tolive values  ...  We further accelerate statistical counting with a new sublinear space data structure Bi-sketch.  ...  With probability at least 1 − δ, the estimate A flows has the following guarantees: A flows ≤ A flows ≤ (1 + )A flows (1) Figure 5 :Figure 6 : 56 Figure 5: Packet No. 1 passes all the hash function tests  ... 
doi:10.32604/cmc.2022.021626 fatcat:mvowoadbwrhwbcsknddyxxzxse

Enabling Efficient and General Subpopulation Analytics in Multidimensional Data Streams [article]

Antonis Manousis, Zhuo Cheng, Ran Ben Basat, Zaoxing Liu, Vyas Sekar
2022 arXiv   pre-print
and universal sketching to ensure accurate estimates for multiple statistics.  ...  We present Hydra, an efficient framework for multidimensional analytics that presents a novel combination of using a "sketch of sketches" to avoid the overhead of monitoring exponentially-many subpopulations  ...  ACKNOWLEDGMENTS We thank the reviewers for their feedback.  ... 
arXiv:2208.04927v1 fatcat:hpjsi2vnjracdjkwqpalabiqr4

A data streaming algorithm for estimating entropies of od flows

Haiquan (Chuck) Zhao, Ashwin Lall, Mitsunori Ogihara, Oliver Spatscheck, Jia Wang, Jun Xu
2007 Proceedings of the 7th ACM SIGCOMM conference on Internet measurement - IMC '07  
Our sketch builds upon and extends the Lp sketch of Indyk with significant additional innovations.  ...  Entropy has recently gained considerable significance as an important metric for network measurement. Previous research has shown its utility in clustering traffic and detecting traffic anomalies.  ...  SINGLE NODE ALGORITHM In this section, we show how our sketch works for estimating the entropy of the traffic stream on a single link; Estimation of OD flow entropy based on its intersection measurable  ... 
doi:10.1145/1298306.1298345 dblp:conf/imc/ZhaoLOSWX07 fatcat:t6t53pwj5zgc3pj4lakrd3ev2q

Uncovering Global Icebergs in Distributed Streams: Results and Implications

Guanyao Huang, Ashwin Lall, Chen-Nee Chuah, Jun Xu
2010 Journal of Network and Systems Management  
We compare several of the state-of-the-art streaming algorithms for estimating local elephants in the individual streams.  ...  We summarize their performance and discuss the implications for the future design of sketches.  ...  ., with non-zero local measurement errors. We propose a combined sketching and sampling approach for detecting and measuring them.  ... 
doi:10.1007/s10922-010-9186-5 fatcat:jw3i2yv7tvfx3hdr6aujufleqi

A high-throughput hardware accelerator for network entropy estimation using sketches

Javier E. Soto, Paulo Ubisse, Yaime Fernandez, Cecilia Hernandez, Miguel Figueroa
2021 IEEE Access  
Tested on real network traces of up to 120 million packets and more than 5 million flows, the accelerator estimates the empirical entropy with less than 1.5% mean relative error and 21 µs latency, and  ...  The method uses sketches to compute the cardinality of the stream and the frequencies of the top-K elements on line, and then it estimates the contribution to the entropy of the rest of the stream assuming  ...  FlexSketchMon [23] is a framework that collects network flow information in the data plane to support various sketch-based algorithms for traffic monitoring and measurement tasks.  ... 
doi:10.1109/access.2021.3088500 fatcat:txcsvtqe5rhabpnpi7ipjkpf5e
« Previous Showing results 1 — 15 out of 62,156 results