Name
Abstract | ||
|---|---|---|
Monitoring network traffic is an important building block for various management and security systems. Typically, the number of active flows in a network node is much larger than the number of available monitoring resources, making it impractical to maintain a "per-flow" state at the node. This situation gave rise to the recent interest in streaming algorithms where complex data structures are used to perform monitoring tasks efficiently. However, these solutions often require complicated "per-packet" operations, which are not feasible in current devices line-rate. Even when the amortized (expected average) complexity is O(1) operations per-packet, some packets may experience a much longer delay, which again is impractical. In this dissertation we study three important monitoring problems (that were recently studied in the context of streaming algorithms) and for each of them we present practical, efficient resource-constrained algorithms. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/NOMS54207.2022.9789793 | PROCEEDINGS OF THE IEEE/IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM 2022 |
DocType | ISSN | Citations |
Conference | 1542-1201 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jalil Moraney | 1 | 1 | 1.70 |
| Danny Raz | 2 | 0 | 0.34 |