Name
Abstract | ||
|---|---|---|
Network measurement is an essential building block for a variety of network applications such as traffic engineering, quality of service, load-balancing and intrusion detection. Maintaining a per-flow state is often impractical, and modern systems use complex data structures that are updated by each incoming packet. Thus, a major challenge is designing measurement applications that operate at line speed. This work provides a unified mechanism that improves the update time of a variety of measurement algorithms. We do so by identifying and optimizing a common algorithmic pattern that we call q-MAX. The goal is to maintain the largest q values in a stream of packets. Our algorithm replaces standard data structures such as heaps and skip lists, and accelerate the performance of measurement algorithms. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/INFCOMW.2019.8845166 | IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) |
Keywords | Field | DocType |
q-MAX,per-flow state,complex data structures,unified mechanism,network measurement throughput | Approximation algorithm,Data structure,Computer science,Network packet,Skip list,Quality of service,Throughput,Intrusion detection system,Traffic engineering,Distributed computing | Conference |
ISSN | ISBN | Citations |
2159-4228 | 978-1-7281-1879-6 | 0 |
PageRank | References | Authors |
0.34 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ran Ben-Basat | 1 | 105 | 19.20 |
| Gil Einziger | 2 | 151 | 20.82 |
| Jalil Moraney | 3 | 1 | 1.70 |
| Danny Raz | 4 | 1643 | 152.24 |