Xiaodong Yi, Junjie Wang, Jingpu Duan, Wei Bai, Chuan Wu, Y. Xiong, Dongsu Han
{"title":"FlowShader: a Generalized Framework for GPU-accelerated VNF Flow Processing","authors":"Xiaodong Yi, Junjie Wang, Jingpu Duan, Wei Bai, Chuan Wu, Y. Xiong, Dongsu Han","doi":"10.1109/ICNP.2019.8888129","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888129","url":null,"abstract":"GPU acceleration has been widely investigated for packet processing in virtual network functions (NFs), but not for L7 flow-processing NFs. In L7 NFs, reassembled TCP messages of the same flow should be processed in order in the same processing thread, and the uneven sizes among flows pose a major challenge for full realization of GPU’s parallel computation power.To exploit GPUs for L7 NF processing, this paper presents FlowShader, a GPU acceleration framework to achieve both high generality and throughput even under skewed flow size distributions. We carefully design an efficient scheduling algorithm that fully exploits available GPU and CPU capacities; in particular, we dispatch large flows which seriously break up the size balance to CPU and the rest of flows to GPU. Furthermore, FlowShader allows similar NF logic (as CPU-based NFs) to run on individual threads in a GPU, which is more generalized and easy to take on as compared to redesigning an NF for operation parallelism on GPU. We implemented a number of L7 flow processing NFs based on FlowShader. Evaluations are conducted under both synthetic and real-world traffic traces and results show that the throughput achieved by FlowShader is up to 6x that of the CPU-only baseline and 3x of the GPU-only design.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115592316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Craig L. Gutterman, G. Zussman, Artur Minakhmetov, Jiakai Yu, Michael Sherman, Tingjun Chen, Shengxiang Zhu, I. Seskar, D. Raychaudhuri, D. Kilper
{"title":"Programmable Optical x-Haul Network in the COSMOS Testbed","authors":"Craig L. Gutterman, G. Zussman, Artur Minakhmetov, Jiakai Yu, Michael Sherman, Tingjun Chen, Shengxiang Zhu, I. Seskar, D. Raychaudhuri, D. Kilper","doi":"10.1109/ICNP.2019.8888108","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888108","url":null,"abstract":"The Cloud-Enhanced Open Software Defined Mobile Wireless Testbed for City-Scale Deployment (COSMOS) platform is a programmable city-scale shared multi-user advanced wireless testbed that is being deployed in West Harlem of New York City [1]. To keep pace with the significantly increased wireless link bandwidth and to effectively integrate the emerging C-RANs, COSMOS is designed to incorporate a fast programmable core network for providing connections across different computing layers. A key feature of COSMOS is its dark fiber based optical x-haul network that enables both highly flexible, user defined network topologies and experimentation directly in the optical physical layer. The optical architecture of COSMOS was presented in [2]. In this abstract, we present the tools and services designed to configure and monitor the performance of optical paths and topologies of the COSMOS testbed. In particular, we present the SDN framework that allows testbed users to implement experiments with application-driven control of optical and data networking functionalities.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123324979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Unison: Enabling Content Provider/ISP Collaboration using a vSwitch Abstraction","authors":"Yimeng Zhao, Ahmed Saeed, M. Ammar, E. Zegura","doi":"10.1109/ICNP.2019.8888032","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888032","url":null,"abstract":"BGP was initially created assuming by default that all ASes are equal. Its policies and protocols, namely BGP, evolved to accommodate a hierarchical Internet, allowing an autonomous system more control over outgoing traffic than incoming traffic. However, the modern Internet is flat, making BGP asymmetrical. In particular, routing decisions are mostly in the hands of traffic sources (i.e., content providers). This leads to suboptimal routing decisions as traffic sources can only estimate route capacity at the destination (i.e., ISP). In this paper, we present the design of Unison, a system that allows an ISP to jointly optimize its intra-domain routes and inter-domain routes, in collaboration with content providers. Unison provides the ISP operator and the neighbors of the ISP with an abstraction ISP network in the form of a virtual switch. This abstraction allows the content providers to program the virtual switch with their requirements. It also allows the ISP to use that information to optimize the overall performance of its network. We show through extensive simulations that Unison can improve ISP throughput by up to 30% through cooperation with content providers. We also show that cooperation of content providers only improves performance, even for non-cooperating content providers (e.g., a single cooperating neighbour can improve ISP throughput by up to 6%).","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126033253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yige Chen, Tianning Zang, Yongzheng Zhang, Yuan Zhou, Yipeng Wang
{"title":"Rethinking Encrypted Traffic Classification: A Multi-Attribute Associated Fingerprint Approach","authors":"Yige Chen, Tianning Zang, Yongzheng Zhang, Yuan Zhou, Yipeng Wang","doi":"10.1109/ICNP.2019.8888043","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888043","url":null,"abstract":"With the unprecedented prevalence of mobile network applications, cryptographic protocols, such as the Secure Socket Layer/Transport Layer Security (SSL/TLS), are widely used in mobile network applications for communication security. The proven methods for encrypted video stream classification or encrypted protocol detection are unsuitable for the SSL/TLS traffic. Consequently, application-level traffic classification based networking and security services are facing severe challenges in effectiveness. Existing encrypted traffic classification methods exhibit unsatisfying accuracy for applications with similar state characteristics. In this paper, we propose a multiple-attribute-based encrypted traffic classification system named Multi-Attribute Associated Fingerprints (MAAF). We develop MAAF based on the two key insights that the DNS traces generated during the application runtime contain classification guidance information and that the handshake certificates in the encrypted flows can provide classification clues. Apart from the exploitation of key insights, MAAF employs the context of the encrypted traffic to overcome the attribute-lacking problem during the classification. Our experimental results demonstrate that MAAF achieves 98.69% accuracy on the real-world traceset that consists of 16 applications, supports the early prediction, and is robust to the scale of the training traceset. Besides, MAAF is superior to the state-of-the-art methods in terms of both accuracy and robustness.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114430834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Anomaly Noise Filtering with Logistic Regression and a New Method for Time Series Trend Computation for Monitoring Systems","authors":"Qing Gao, Li-Min Zhu, Yuxin Lin, Xun Chen","doi":"10.1109/ICNP.2019.8888110","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888110","url":null,"abstract":"Anomaly detection has always been a hot topic in signal processing and machine learning. Convolutional Neural Network (CNN) is an effective technique to detect anomaly. However, at Ant Financial, a simple CNN neglects certain patterns in real-world data that may lead to triggering of false alarms. To reduce the possibility of a false alarm, we run an anomaly noise filtering model after the CNN. In this paper, we introduce techniques to develop the model and a new method of time series trend computation. The model helps increase the accuracy in detecting false anomalies of a rise-fall pattern in the traffic(y-value) of a time series dataset. At the end of the paper, we will present the benchmarks of using our method on real online systems at Ant Financial.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129571736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ting Qu, Raj Joshi, M. Chan, B. Leong, Deke Guo, Zhong Liu
{"title":"SQR: In-network Packet Loss Recovery from Link Failures for Highly Reliable Datacenter Networks","authors":"Ting Qu, Raj Joshi, M. Chan, B. Leong, Deke Guo, Zhong Liu","doi":"10.1109/ICNP.2019.8888055","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888055","url":null,"abstract":"In datacenter networks, flows need to complete as quickly as possible because the flow completion time (FCT) directly impacts user experience, and thus revenue. Link failures can have a significant impact on short latency-sensitive flows because they increase their FCTs by several fold. Existing link failure management techniques cannot keep the FCTs low under link failures because they cannot completely eliminate packet loss during such failures. We observe that to completely mask the effect of packet loss and the resulting long recovery latency, the network has to be responsible for packet loss recovery instead of relying on end-to-end recovery. To this end, we propose Shared Queue Ring (SQR), an on-switch mechanism that completely eliminates packet loss during link failures by diverting the affected flows seamlessly to alternative paths. We implemented SQR on a Barefoot Tofino switch using the P4 programming language. Our evaluation on a hardware testbed shows that SQR can completely mask link failures and reduce tail FCT by up to 4 orders of magnitude for latency-sensitive workloads.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128206551","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CoRE: Non-Linear 3D Sampling for Robust 360° Video Streaming","authors":"M. Palash, V. Popescu, Amit Sheoran, S. Fahmy","doi":"10.1109/ICNP.2019.8888135","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888135","url":null,"abstract":"CoRE is an approach for streaming 360° videos based on a non-linear sampling of the equirectangular video cube. CoRE is robust to view prediction errors.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129212019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Light-weight Trust Mechanism for Cloud-Edge Collaboration Framework","authors":"Zhipeng Gao, Chenxi Xia, Zhuojun Jin, Qian Wang, Junmeng Huang, Yang Yang, Lanlan Rui","doi":"10.1109/ICNP.2019.8888037","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888037","url":null,"abstract":"With the development of the edge computing and cloud computing technology, the cloud-edge collaboration framework is proposed as a new effective computing architecture and applied in many fields. However, due to the openness of the edge networks, the security of cloud-edge framework is an unavoidable problem and most recent trust mechanism could not resist mixed malicious attacks at the same time. In this work, a light-weight and reliable trust mechanism based on the improved LightGBM algorithm is originally proposed to evaluate the credibility of edge devices. First, we design a light-weight trust mechanism for edge devices to process raw interaction data and extract trust features, which reduces the amount of data transmission and the pressure on the communication networks. In addition, an evaluation algorithm based on the entropy weight method (EWM) and punishment factors is designed for edge brokers to distinguish the malicious devices from the normal ones, which performs great against mixed malicious attacks. At last, we propose an improved LightGBM algorithm developed in the centralized cloud to learn other researchers’ evaluation methods and check the evaluation uploaded from edge brokers, which could make the punishment factors of edge networks weighted adaptively with the change of edge networks. The experimental results show the proposed trust mechanism outperforms existing methods in the accuracy and discriminating speed under mixed malicious attacks.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116327967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jianhua He, A. Radford, Laura Li, Zhiliang Xiong, Zuoyin Tang, Xiaoming Fu, S. Leng, Fan Wu, Kaisheng Huang, Jianye Huang, J. Zhang, Yan Zhang
{"title":"Cooperative Connected Autonomous Vehicles (CAV): Research, Applications and Challenges","authors":"Jianhua He, A. Radford, Laura Li, Zhiliang Xiong, Zuoyin Tang, Xiaoming Fu, S. Leng, Fan Wu, Kaisheng Huang, Jianye Huang, J. Zhang, Yan Zhang","doi":"10.1109/ICNP.2019.8888126","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888126","url":null,"abstract":"Road accidents and traffic congestion are two critical problems for global transport systems. Connected vehicles (CV) and automated vehicles (AV) are among the most heavily researched and promising automotive technologies to reduce road accidents and improve road efficiency. However, both AV and CV technologies have inherent shortcomings, for example, line of sight sensing limitation of AV sensors and the dependency of high penetration rate for CVs. In this paper we present a cooperative connected intelligent vehicles (CAV) framework. It is motivated by the observation that vehicles are increasingly intelligent with various levels of autonomous functionalities. The vehicles intelligence is boosted by more sensing and computing resources. These sensor and computing resources of CAV vehicles and the transport infrastructure could be shared and exploited. With resource sharing and cooperation CAVs can have comprehensive perception of driving environments, and novel cooperative applications can be developed to improve road safety and efficiency (RSE). The key feature of the cooperative CAV system is the cooperation within and across the key players in the road transport systems and across system layers. For example, the various levels of cooperation include cooperative sensing, cooperative RSE applications and cooperation among the vehicles and among the vehicles and infrastructure. We will present the potentials that could be brought by cooperative CAV, the roadmap for research and development, the preliminary research results and open issues.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115813567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jingling Liu, Jiawei Huang, Weihe Li, Jianxin Wang
{"title":"AG: Adaptive Switching Granularity for Load Balancing with Asymmetric Topology in Data Center Network","authors":"Jingling Liu, Jiawei Huang, Weihe Li, Jianxin Wang","doi":"10.1109/ICNP.2019.8888076","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888076","url":null,"abstract":"Modern data center topologies often take the form of a multi-rooted tree with rich parallel paths to provide high bandwidth. However, various path diversities caused by traffic dynamics, link failures and heterogeneous switching equipments widely exist in production datacenter network. Therefore, the multi-path load balancer in data center should be robust to these diversities. Although prior fine-grained schemes such as RPS and Presto make full use of available paths, they are prone to experience packet reordering problem under asymmetric topology. The coarse-grained solutions such as ECMP and LetFlow effectively avoid packet reordering, but easily lead to under-utilization of multiple paths. To cope with these inefficiencies, we propose a load balancing mechanism called AG, which adaptively adjusts switching granularity according to the asymmetric degree of multiple paths. AG increases switching granularity to alleviate packet reordering under large degrees of topology asymmetry, while reducing switching granularity to obtain high link utilization under small degrees of topology asymmetry. AG is deployed on the switches with negligible overhead, while making no modification on end-hosts. We evaluate AG through both Mininet testbed and large-scale NS2 simulations. The experimental results show that AG reduces the average and 99th flow completion time by up to 51% and 56% over the state-of-the-art load balancing schemes, respectively.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132875149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}