A faster and more efficient q-MAX algorithm

Ran Ben Basat; Gil Einziger; Bilal Tayh

doi:10.1145/3386367.3431671

A faster and more efficient q-MAX algorithm

Ran Ben Basat
, Gil Einziger
, Bilal Tayh

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The q-MAX problem, which seeks to find the q largest elements in a data stream, has numerous networking applications including sketches, network-wide heavy hitters, and others. In this poster, we propose an improvement to the q-MAX algorithm [5] that leverages sampling to accelerate the computation. Despite being randomized, our algorithm never fails (i.e., it is a Las Vegas algorithm) and runs up to 62% faster when evaluated on real packet traces and tasks. Moreover, on a real networking application and workload, our algorithm provides an 11-53% higher throughput.

Original language	English
Title of host publication	CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies
Publisher	Association for Computing Machinery, Inc
Pages	538-539
Number of pages	2
ISBN (Electronic)	9781450379489
DOIs	https://doi.org/10.1145/3386367.3431671
State	Published - 23 Nov 2020
Event	16th ACM Conference on Emerging Networking Experiment and Technologies, CoNEXT 2020 - Barcelona, Spain Duration: 1 Dec 2020 → 4 Dec 2020

Publication series

Name	CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies

Conference

Conference	16th ACM Conference on Emerging Networking Experiment and Technologies, CoNEXT 2020
Country/Territory	Spain
City	Barcelona
Period	1/12/20 → 4/12/20

Keywords

algorithms
data structures
measurement
monitoring

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1145/3386367.3431671

Cite this

Basat, R. B., Einziger, G., & Tayh, B. (2020). A faster and more efficient q-MAX algorithm. In CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies (pp. 538-539). (CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies). Association for Computing Machinery, Inc. https://doi.org/10.1145/3386367.3431671

Basat, Ran Ben ; Einziger, Gil ; Tayh, Bilal. / A faster and more efficient q-MAX algorithm. CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies. Association for Computing Machinery, Inc, 2020. pp. 538-539 (CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies).

@inproceedings{ea97892a86e948dc8b4bdc1409c2af31,

title = "A faster and more efficient q-MAX algorithm",

abstract = "The q-MAX problem, which seeks to find the q largest elements in a data stream, has numerous networking applications including sketches, network-wide heavy hitters, and others. In this poster, we propose an improvement to the q-MAX algorithm [5] that leverages sampling to accelerate the computation. Despite being randomized, our algorithm never fails (i.e., it is a Las Vegas algorithm) and runs up to 62\% faster when evaluated on real packet traces and tasks. Moreover, on a real networking application and workload, our algorithm provides an 11-53\% higher throughput.",

keywords = "algorithms, data structures, measurement, monitoring",

author = "Basat, \{Ran Ben\} and Gil Einziger and Bilal Tayh",

note = "Publisher Copyright: {\textcopyright} 2020 ACM.; 16th ACM Conference on Emerging Networking Experiment and Technologies, CoNEXT 2020 ; Conference date: 01-12-2020 Through 04-12-2020",

year = "2020",

month = nov,

day = "23",

doi = "10.1145/3386367.3431671",

language = "English",

series = "CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies",

publisher = "Association for Computing Machinery, Inc",

pages = "538--539",

booktitle = "CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies",

}

Basat, RB, Einziger, G & Tayh, B 2020, A faster and more efficient q-MAX algorithm. in CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies. CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies, Association for Computing Machinery, Inc, pp. 538-539, 16th ACM Conference on Emerging Networking Experiment and Technologies, CoNEXT 2020, Barcelona, Spain, 1/12/20. https://doi.org/10.1145/3386367.3431671

A faster and more efficient q-MAX algorithm. / Basat, Ran Ben; Einziger, Gil; Tayh, Bilal.
CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies. Association for Computing Machinery, Inc, 2020. p. 538-539 (CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A faster and more efficient q-MAX algorithm

AU - Basat, Ran Ben

AU - Einziger, Gil

AU - Tayh, Bilal

PY - 2020/11/23

Y1 - 2020/11/23

N2 - The q-MAX problem, which seeks to find the q largest elements in a data stream, has numerous networking applications including sketches, network-wide heavy hitters, and others. In this poster, we propose an improvement to the q-MAX algorithm [5] that leverages sampling to accelerate the computation. Despite being randomized, our algorithm never fails (i.e., it is a Las Vegas algorithm) and runs up to 62% faster when evaluated on real packet traces and tasks. Moreover, on a real networking application and workload, our algorithm provides an 11-53% higher throughput.

AB - The q-MAX problem, which seeks to find the q largest elements in a data stream, has numerous networking applications including sketches, network-wide heavy hitters, and others. In this poster, we propose an improvement to the q-MAX algorithm [5] that leverages sampling to accelerate the computation. Despite being randomized, our algorithm never fails (i.e., it is a Las Vegas algorithm) and runs up to 62% faster when evaluated on real packet traces and tasks. Moreover, on a real networking application and workload, our algorithm provides an 11-53% higher throughput.

KW - algorithms

KW - data structures

KW - measurement

KW - monitoring

UR - https://www.scopus.com/pages/publications/85097590981

U2 - 10.1145/3386367.3431671

DO - 10.1145/3386367.3431671

M3 - Conference contribution

AN - SCOPUS:85097590981

T3 - CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies

SP - 538

EP - 539

BT - CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies

PB - Association for Computing Machinery, Inc

T2 - 16th ACM Conference on Emerging Networking Experiment and Technologies, CoNEXT 2020

Y2 - 1 December 2020 through 4 December 2020

ER -

Basat RB, Einziger G, Tayh B. A faster and more efficient q-MAX algorithm. In CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies. Association for Computing Machinery, Inc. 2020. p. 538-539. (CoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies). doi: 10.1145/3386367.3431671

A faster and more efficient q-MAX algorithm

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this