STCS: Spatial-Temporal Collaborative Sampling in Flow-Aware Software Defined Networks

被引:41
作者
Wang, Xiaofei [1 ]
Li, Xiuhua [2 ,3 ]
Pack, Sangheon [4 ]
Han, Zhu [5 ,6 ]
Leung, Victor C. M. [7 ,8 ]
机构
[1] Tianjin Univ, Sch Comp Sci & Technol, Tianjin Key Lab Adv Net Working, Tianjin 300072, Peoples R China
[2] Sch Big Data & Software Engn, Chongqing 401331, Peoples R China
[3] Chongqing Univ, Educ Minist, Key Lab Dependable Serv Comp Cyber Phys Soc, Chongqing, Peoples R China
[4] Korea Univ, Sch Elect Engn, Seoul 02841, South Korea
[5] Univ Houston, Dept Elect & Comp Engn, Houston, TX 77004 USA
[6] Kyung Hee Univ, Dept Comp Sci & Engn, Seoul 02841, South Korea
[7] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China
[8] Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC V6T 1Z4, Canada
基金
新加坡国家研究基金会; 加拿大自然科学与工程研究理事会;
关键词
Mice; Collaboration; Control systems; Electronic mail; Quality of service; Security; Computer science; Software-defined networking; flow awareness; spatial-temporal collaborative sampling; sampling accuracy; redundant packets; time complexity;
D O I
10.1109/JSAC.2020.2986688
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
General traffic analysis based on deep packet inspection (DPI) techniques at switches cannot grasp the detailed knowledge of network applications going into internal switches, and the statistics-based reports of switches lack flow-level recognition of the traffic. Besides, DPI is generally expensive and has limited performance. Therefore, network-wise accurate flow-awareness by packet sampling is highly desirable for fine-grained quality of service guarantee, internal network management, traffic engineering, security analysis, and so on. In this paper, we propose a Spatial-Temporal Collaborative Sampling (STCS) framework in the flow-aware software-defined networks (SDNs). Particularly, considering the spatial-temporal factors and limits of network resources, the formulated STCS problem aims to maximize the network-wise sampling accuracy of flows including mice flows and elephant flows by characterizing both of the comprehensive influences of switches and the effects on sampling accuracy imposed by the collaborative strategy among switches in the spatial-temporal dimension. We propose a suboptimal approach to address the complex STCS problem in two steps: 1) Top-K switch selection based on the iterative comprehensive influence, and 2) sampling time slot allocation based on the local value maximization. Trace-driven evaluation results demonstrate the effectiveness of the proposed framework on improving the sampling accuracy and reducing redundant packets.
引用
收藏
页码:999 / 1013
页数:15
相关论文
共 37 条
[1]  
Addad R. A., 2018, PROC IEEE GLOBAL COM, P1
[2]   Detecting heavy flows in the SDN match and action model [J].
Afek, Yehuda ;
Bremler-Barr, Anat ;
Feibish, Shir Landau ;
Schiff, Liron .
COMPUTER NETWORKS, 2018, 136 :1-12
[3]   Toward Elastic Distributed SDN/NFV Controller for 5G Mobile Cloud Management Systems [J].
Aissioui, Abdelkader ;
Ksentini, Adlen ;
Gueroui, Abdelhak ;
Taleb, Tarik .
IEEE ACCESS, 2015, 3 :2055-2064
[4]  
Benson T., 2010, Proceedings of the 10th annual conference on Internet measurement - IMC '10, P267, DOI [DOI 10.1145/1879141.1879175, 10.1145/1879141.1879175]
[5]   Cost-based placement of virtualized Deep Packet Inspection functions in SDN [J].
Bouet, Mathieu ;
Leguay, Jeremie ;
Conan, Vania .
2013 IEEE MILITARY COMMUNICATIONS CONFERENCE (MILCOM 2013), 2013, :992-997
[6]   Deep Packet Inspection as a Service [J].
Bremler-Barr, Anat ;
Harchol, Yotam ;
Hay, David ;
Koral, Yaron .
PROCEEDINGS OF THE 2014 CONFERENCE ON EMERGING NETWORKING EXPERIMENTS AND TECHNOLOGIES (CONEXT'14), 2014, :271-282
[7]  
Cai H, 2019, IEEE ICC
[8]   Task Offloading for Mobile Edge Computing in Software Defined Ultra-Dense Network [J].
Chen, Min ;
Hao, Yixue .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2018, 36 (03) :587-597
[9]  
Cheng G., 2017, PROC 12 INT C FUTURE, P1
[10]   Sampling-on-Demand in SDN [J].
Cohen, Reuven ;
Moroshko, Evgeny .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (06) :2612-2622