2 Hits in 3.7 sec

Adversarial Robustness of Streaming Algorithms through Importance Sampling [article]

Vladimir Braverman, Avinatan Hassidim, Yossi Matias, Mariano Schain, Sandeep Silwal, Samson Zhou
2021 arXiv   pre-print
Our results are based on a simple, but powerful, observation that many importance sampling-based algorithms give rise to adversarial robustness which is in contrast to sketching based algorithms, which  ...  (Abstract shortened to meet arXiv limits)  ...  One sketch to rule them all: Rethinking network flow monitoring with univmon. In Proceedings of the 2016 ACM SIGCOMM Conference, page 101-114, 2016. 2 [Mac20] Giuliano Oliveira De Macedo.  ... 
arXiv:2106.14952v2 fatcat:6u6p5b2idrgptkj5yb7nhmxlcm

Towards Elastic and Resilient In-Network Computing

Daehyeok Kim
Although resource elasticity and fault resiliency have been extensively studied for traditional CPU server-based computing, we find that enabling them on programmable networking devices is challenging,  ...  Elasticity can address the shortcoming that today's in-network computing only supports a simple deployment model where a single application runs on a single device equipped with fixed and limited resources  ...  The sketch-based monitor collects statistics for the remaining traffic classes using an UnivMon sketch [146] .  ... 
doi:10.1184/r1/19699579.v1 fatcat:e3hwycb4izhxrj4t24i7jac4qu