IEEE INFOCOM 2018 - IEEE Conference on Computer Communications 2018
DOI: 10.1109/infocom.2018.8485998
|View full text |Cite
|
Sign up to set email alerts
|

You Can Drop but You Can't Hide: <tex>$K$</tex>-persistent Spread Estimation in High-speed Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
4
1

Relationship

1
8

Authors

Journals

citations
Cited by 35 publications
(7 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…Filter [58] Virtual Register Sharing [67] Virtual HyperLogLog [70] Counter tree [75] Braids [22] SketchVisor [135] MAPLE [160] NitroSketch [55], R HHH [54] CASE [174] CASE [183], RCC [87] HeavyGuardian [100] Sliding HLL [127] Fast sketch [120], OPA [115] Sequential hashing [112] Modular hashing [119] Bitcount [143], CBF [50] SketchLearn [20] Group Testing [159] HeavyKeeper [99] HeavyGuardian [100] ICE-Buckets [52] HyperSight [153] MultiResBitmap [170] HLL-TailCut+ [74], RAP [93], Frequent [94] ACE [125], Conservative update [88] CountMax [96], LCF [184], LR(T) [185], SpaceSaving [95], CSketch [89], CSM [90] CHHFR [171], Refined LL [166] CounterMap [198], IMP [118] SketchVisor [135], WCSS[128] SWAMP [129], RCD [113] Defeat …”
Section: Improve Accuracymentioning
confidence: 99%
See 1 more Smart Citation
“…Filter [58] Virtual Register Sharing [67] Virtual HyperLogLog [70] Counter tree [75] Braids [22] SketchVisor [135] MAPLE [160] NitroSketch [55], R HHH [54] CASE [174] CASE [183], RCC [87] HeavyGuardian [100] Sliding HLL [127] Fast sketch [120], OPA [115] Sequential hashing [112] Modular hashing [119] Bitcount [143], CBF [50] SketchLearn [20] Group Testing [159] HeavyKeeper [99] HeavyGuardian [100] ICE-Buckets [52] HyperSight [153] MultiResBitmap [170] HLL-TailCut+ [74], RAP [93], Frequent [94] ACE [125], Conservative update [88] CountMax [96], LCF [184], LR(T) [185], SpaceSaving [95], CSketch [89], CSM [90] CHHFR [171], Refined LL [166] CounterMap [198], IMP [118] SketchVisor [135], WCSS[128] SWAMP [129], RCD [113] Defeat …”
Section: Improve Accuracymentioning
confidence: 99%
“…k out of t persistence. Although we can separate attackers from the legitimates by finding flows appearing during all measurement periods, Huang et al [160] considered the situation that attackers might give up sending packets during several periods. To solve this problem, they formulate a new problem called k-persistent spread estimation, which measures persistent traffic elements in each flow that appear during at least k out of t measurement periods.…”
Section: ) Time Dimensionmentioning
confidence: 99%
“…Network traffic measurement is another branch of the traffic measurement, which is similar to transportation traffic measurement. Various methods [2], [3], [8], [13], [28], [29] have been proposed for network traffic measurement, which is to measure the network traffic in a network router. However, we need to protect the trajectory privacy of vehicles in transportation traffic measurement, which is not considered in the network traffic measurement.…”
Section: Related Workmentioning
confidence: 99%
“…A CCURATE and timely network traffic measurement is an essential part of network security management and network information forensics, e.g., host cardinality measurement [1]- [5], flow size measurement [6]- [10], abnormal behavior measurement [11]- [15], and persistent spread measurement [16], [17]. Among these applications, host cardinality measurement is a distinctive task.…”
Section: Introductionmentioning
confidence: 99%