Applications of sketches in network traffic measurement: A survey

被引:18
作者
Han, Hui [1 ]
Yan, Zheng [1 ,2 ]
Jing, Xuyang [3 ]
Pedrycz, Witold [4 ]
机构
[1] Xidian Univ, Sch Cyber Engn, State Key Lab Integrated Serv Networks, Xian, Peoples R China
[2] Aalto Univ, Dept Commun & Networking, Espoo, Finland
[3] Qingdao Univ, Inst Future IFF, Qingdao, Peoples R China
[4] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB, Canada
基金
芬兰科学院; 中国国家自然科学基金;
关键词
Network traffic measurement; Sketches; Cardinality estimation; Flow size estimation; Change anomalies; Persistent spreader detection; CARDINALITY ESTIMATION; COUNTER ARCHITECTURE; SPREAD ESTIMATION; ANOMALY DETECTION; ALGORITHM; ACCURATE; TIME; CLASSIFICATION; FRAMEWORK; SECURITY;
D O I
10.1016/j.inffus.2021.12.007
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Accurate and timely network traffic measurement is essential for network status monitoring, network fault analysis, network intrusion detection, and network security management. With the rapid development of the network, massive network traffic brings severe challenges to network traffic measurement. However, existing measurement methods suffer from many limitations for effectively recording and accurately analyzing big volume traffic. Recently, sketches, a family of probabilistic data structures that employ hashing technology for summarizing traffic data, have been widely used to solve these problems. However, current literature still lacks a thorough review on sketch-based traffic measurement methods to offer a comprehensive insight on how to apply sketches for fulfilling various traffic measurement tasks. In this paper, we provide a detailed and comprehensive review on the applications of sketches in network traffic measurement. To this end, we classify the network traffic measurement tasks into four categories based on the target of traffic measurement, namely cardinality estimation, flow size estimation, change anomaly detection, and persistent spreader identification. First, we briefly introduce these four types of traffic measurement tasks and discuss the advantages of applying sketches. Then, we propose a series of requirements with regard to the applications of sketches in network traffic measurement. After that, we perform a fine-grained classification for each sketch-based measurement category according to the technologies applied on sketches. During the review, we evaluate the performance, advantages and disadvantages of current sketch-based traffic measurement methods based on the proposed requirements. Through the thorough review, we gain a number of valuable implications that can guide us to choose and design proper traffic measurement methods based on sketches. We also review a number of general sketches that are highly expected in modern network systems to simultaneously perform multiple traffic measurement tasks and discuss their performance based on the proposed requirements. Finally, through our serious review, we summarize a number of open issues and identify several promising research directions.
引用
收藏
页码:58 / 85
页数:28
相关论文
共 126 条
  • [1] Programming Protocol-Independent Packet Processors
    Bosshart, Pat
    Daly, Dan
    Gibb, Glen
    Izzard, Martin
    McKeown, Nick
    Rexford, Jennifer
    Schlesinger, Cole
    Talayco, Dan
    Vahdat, Amin
    Varghese, George
    Walker, David
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2014, 44 (03) : 87 - 95
  • [2] Sequential hashing: A flexible approach for unveiling significant patterns in high speed networks
    Bu, Tian
    Cao, Jin
    Chen, Aiyou
    Lee, Patrick P. C.
    [J]. COMPUTER NETWORKS, 2010, 54 (18) : 3309 - 3326
  • [3] Combining sketches and wavelet analysis for multi time-scale network anomaly detection
    Callegari, C.
    Giordano, S.
    Pagano, M.
    Pepe, T.
    [J]. COMPUTERS & SECURITY, 2011, 30 (08) : 692 - 704
  • [4] An information-theoretic method for the detection of anomalies in network traffic
    Callegari, Christian
    Giordano, Stefano
    Pagano, Michele
    [J]. COMPUTERS & SECURITY, 2017, 70 : 351 - 365
  • [5] Callegari C, 2015, 2015 INTERNATIONAL CONFERENCE ON COMPUTING AND NETWORK COMMUNICATIONS (COCONET), P157, DOI 10.1109/CoCoNet.2015.7411181
  • [6] Callegari C, 2013, IEEE CONF COMM NETW, P350, DOI 10.1109/CNS.2013.6682725
  • [7] Tracking Cardinality Distributions in Network Traffic
    Chen, Aiyou
    Li, Li Erran
    Cao, Jin
    [J]. IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 819 - 827
  • [8] Counter Tree: A Scalable Counter Architecture for Per-Flow Traffic Measurement
    Chen, Min
    Chen, Shigang
    Cai, Zhiping
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (02) : 1249 - 1262
  • [9] Chen S, 2017, WIRELESS NETW-GER, P1, DOI 10.1007/978-3-319-47340-6
  • [10] Chen WJ, 2013, IEEE INFOCOM SER, P1788