Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Yaron Kassner"'
Publikováno v:
IEEE/ACM Transactions on Networking. 27:1432-1445
Network management protocols often require timely and meaningful insight about per flow network traffic. This paper introduces Randomized Admission Policy (RAP) –a novel algorithm for the frequency , top-k , and byte volume estimation problems, whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75cbed320ed20d6c3264cf0b7e61671d
https://doi.org/10.1109/tnet.2019.2918929
https://doi.org/10.1109/tnet.2019.2918929
Publikováno v:
Algorithmica. 81:2072-2091
This paper considers the problem of estimating the sum the last $$W$$ elements of a stream of integers in $$\left\{ 0,1,\ldots , R \right\} $$ . Specifically, we study the memory requirements for computing a $$ R W\varepsilon $$ -additive approximati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc3fdcfe9184be5f75fa3ff829862ed6
https://doi.org/10.1007/s00453-018-0524-4
https://doi.org/10.1007/s00453-018-0524-4
Autor:
Gil Einziger, Ran Ben-Basat, Zaoxing Liu, Yaron Kassner, Vladimir Braverman, Vyas Sekar, Roy Friedman
Publikováno v:
SIGCOMM
Software switches are emerging as a vital measurement vantage point in many networked systems. Sketching algorithms or sketches, provide high-fidelity approximate measurements, and appear as a promising alternative to traditional approaches such as p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9593e9dac68631a016b5d09f2e30faf3
https://doi.org/10.1145/3341302.3342076
https://doi.org/10.1145/3341302.3342076
Publikováno v:
SYSTOR
In Distributed Denial of Service (DDoS) attacks, an attacker tries to disable a service with a flood of seemingly legitimate requests from multiple devices; this is usually accompanied by a sharp spike in the number of distinct IP addresses / flows a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d94af432aa7d3d726fd951ab73f3fd8
https://doi.org/10.1145/3078468.3078491
https://doi.org/10.1145/3078468.3078491
Publikováno v:
INFOCOM Workshops
Bloom filters and their variants support membership or multiplicity queries with a low probabilistic error. For many networking applications, recent data is more significant than older data, motivating the need for sliding window solutions. In this w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9aa3d38df408b56051086f8062801386
https://doi.org/10.1109/infcomw.2017.8116536
https://doi.org/10.1109/infcomw.2017.8116536
Publikováno v:
INFOCOM
Monitoring the traffic volumes of elephant flows, including the total byte count per flow, is a fundamental capability for online network measurements. We present an asymptotically optimal algorithm for solving this problem in terms of both space and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ceaf6b46801cbdd78da4a25b1e8a733
Publikováno v:
INFOCOM
Identifying heavy hitter flows is a fundamental problem in various network domains. The well established method of using sketches to approximate flow statistics suffers from space inefficiencies. In addition, flow arrival rates are dynamic, thus keep
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cecefedf21e6be62398ae5d59404b21e
https://doi.org/10.1109/infocom.2016.7524364
https://doi.org/10.1109/infocom.2016.7524364
Measurement capabilities are essential for a variety of network applications, such as load balancing, routing, fairness and intrusion detection. These capabilities require large counter arrays in order to monitor the traffic of all network flows. Whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14270ccb254e924e1262378355526162
Publikováno v:
INFOCOM
Network management protocols often require timely and meaningful insight about per flow network traffic. This paper introduces Randomized Admission Policy (RAP) - a novel algorithm for the frequency and top-k estimation problems, which are fundamenta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10765d9ef34a539518fade2d04f10a1a
Publikováno v:
INFOCOM
Measurement capabilities are essential for a variety of network applications, such as load balancing, routing, fairness and intrusion detection. These capabilities require large counter arrays in order to monitor the traffic of all network flows. Whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89b87bcaf666d569bcecfbff0e443d05
https://doi.org/10.1109/infocom.2015.7218646
https://doi.org/10.1109/infocom.2015.7218646