Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Benny Fellman

dblp:167/4100 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
0000-0003-0314-5128ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Network measurement and analytics · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 77% Memory systems · 23%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network measurement and analytics › sketch-based measurement
counter estimation
0.522018
ICE Buckets: Improved Counter Estimation for Network Measurement · IEEE/ACM Trans. Netw. 2018
Independent counter estimation buckets · INFOCOM 2015
Network measurement and analytics
traffic measurement
0.212015
Independent counter estimation buckets · INFOCOM 2015
Performance modeling and evaluation
workload characterization
0.212015
Independent counter estimation buckets · INFOCOM 2015
Memory systems › random-access memory
SRAM
0.112015
Independent counter estimation buckets · INFOCOM 2015

Methods — techniques the papers use, named apart from their topics

estimation theory · 0.4closed-form analysis · 0.4statistical estimation · 0.3
YearPublicationVenuePosition
2018 ICE Buckets: Improved Counter Estimation for Network Measurement
Gil Einziger, Benny Fellman, Roy Friedman 0001, Yaron Kassner
IEEE/ACM Trans. Netw.2
2015 Independent counter estimation buckets
abstract
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. While commodity SRAM memories are capable of operating at line speed, they are too small to accommodate large counter arrays. Previous works suggested estimators, which trade precision for reduced space. However, in order to accurately estimate the largest counter, these methods compromise the accuracy of the rest of the counters. In this work we present a closed form representation of the optimal estimation function. We then introduce Independent Counter Estimation Buckets (ICE-Buckets), a novel algorithm that improves estimation accuracy for all counters. This is achieved by separating the flows to buckets and configuring the optimal estimation function according to each bucket's counter scale. We prove an improved upper bound on the relative error and demonstrate an accuracy improvement of up to 57 times on real Internet packet traces.
Gil Einziger, Benny Fellman, Yaron Kassner
INFOCOM2