{"title":"When NFV Meets ANN: Rethinking Elastic Scaling for ANN-based NFs","authors":"Menghao Zhang, Jia-Ju Bai, Guanyu Li, Zili Meng, Hongda Li, Hongxin Hu, Mingwei Xu","doi":"10.1109/ICNP.2019.8888133","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888133","url":null,"abstract":"Network Function Virtualization (NFV) provides middleboxes with substantial elasticity from a system level, and Artificial Neural Network (ANN) empowers middleboxes with great intelligence from an algorithm-level perspective. However, when ANN-based Network Functions (NFs) want to take advantage of the elasticity of NFV, our study finds that huge gaps exist between the existing approaches and the ideal goals for the elasticity control of ANN-based NFs. By revealing the key differences between ANN-based NFs and traditional NFs, we propose LEGO, an innovative framework that provides systematic mechanisms for traffic splitting, instance partition and runtime management to enable correct and efficient scaling of ANN-based NFs. Preliminary implementation and evaluation demonstrate the feasibility and effectiveness of the LEGO system. The major purpose of this paper is to highlight these challenges and sketch out a new roadmap towards ANN-based NFV paradigm.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"45 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":"131560105","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":"Achieving Universal Low-Power Wide-Area Networks on Existing Wireless Devices","authors":"Zhijun Li, Yongrui Chen","doi":"10.1109/ICNP.2019.8888066","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888066","url":null,"abstract":"Low-Power Wide-Area Network (LPWAN) is an emerging platform for Internet-of-Thing (IoT) devices to access the base station far away. However, two of the most popular IoT techniques, Bluetooth and ZigBee, can not be connected to LPWAN directly due to their very short communication distance (e.g., 30 meters). Our work, named as Symphony, implements an universal LPWAN on existing heterogeneous wireless devices by overcoming two challenges. First, Symphony achieves a long-range communication from both Bluetooth Low Energy (BLE) and ZigBee to LoRaWAN, enabling these ubiquitously deployed low-power devices to access a base station from faraway. It is achieved by exploiting Narrow-Band Communication, where the BLE/ZigBee devices generate ultra narrow-band signals (i.e., single-tone sinusoidal signals) through payload manipulation, while the LoRaWAN base station detects these signals via its demodulator, which has a high receiver sensitivity for long range communication. Second, Symphony enables concurrent transmissions from heterogeneous radios (i.e., BLE, ZigBee and LoRa) at a LoRaWAN base station. This is achieved by Cross-Technology Parallel Decoding, which is able to disentangle and decode the interfering transmissions. Our evaluations on USRP and commodity devices reveal that Symphony achieves a concurrent wireless communication from BLE, ZigBee and LoRa commercial chips to a LoRaWAN base station over 500 meters, $16 times$ range extension over native BLE/ZigBee.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"46 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":"124317669","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":"BDAC: A Behavior-aware Dynamic Adaptive Configuration on DHCP in Wireless LANs","authors":"Congcong Miao, Jilong Wang, Tianying Ji, Hui Wang, Chao Xu, Fenghua Li, Fengyuan Ren","doi":"10.1109/ICNP.2019.8888048","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888048","url":null,"abstract":"DHCP is widely used to dynamically allocate IP addresses to the devices on local area networks, but the explosive increases of WiFi devices and their frequent mobility pose great challenges on DHCP performance in wireless LANs. In this paper, by analyzing large scale real network traces, we observe that the dynamic WiFi user behavior (e.g., online time pattern and spatio-temporal mobility pattern) leads to the poor DHCP performance. The IP pools in some VLANs have been exhausted in rush hours although the total IP utilization in WLAN is only 24%. Therefore, we have to configure IP lease times and IP pools dynamically and make sure that they are adaptive to the WiFi user behavior. In order to achieve this goal, we characterize and model the user behavior across online time pattern and spatiotemporal mobility pattern. Then we propose BDAC, a behaviour-aware dynamic adaptive configuration, which is combined of two strategies: adaptive IP lease time configuration and dynamic IP pool configuration. The former is to set adaptive lease times across user roles and area types based on online time pattern to reclaim IP addresses in time and reduce the peak IP usage, while the latter dynamically migrates the IP addresses across VLANs based on spatio-temporal mobility correlation to save the IP addresses. Using the real network traces of a different week, we conduct experiments to evaluate the performance of BDAC. Results show that BDAC can save up to 60% of IP addresses and the actual IP utilization rises from 24% to 59%. Furthermore, BDAC maintains high IP utilization when the number of VLANs in a WLAN increases.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"126 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":"115620674","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}
Jens Hiller, J. Pennekamp, M. Dahlmanns, Martin Henze, A. Panchenko, Klaus Wehrle
{"title":"Tailoring Onion Routing to the Internet of Things: Security and Privacy in Untrusted Environments","authors":"Jens Hiller, J. Pennekamp, M. Dahlmanns, Martin Henze, A. Panchenko, Klaus Wehrle","doi":"10.1109/ICNP.2019.8888033","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888033","url":null,"abstract":"An increasing number of IoT scenarios involve mobile, resource-constrained IoT devices that rely on untrusted networks for Internet connectivity. In such environments, attackers can derive sensitive private information of IoT device owners, e.g., daily routines or secret supply chain procedures, when sniffing on IoT communication and linking IoT devices and owner. Furthermore, untrusted networks do not provide IoT devices with any protection against attacks from the Internet. Anonymous communication using onion routing provides a well-proven mechanism to keep the relationship between communication partners secret and (optionally) protect against network attacks. However, the application of onion routing is challenged by protocol incompatibilities and demanding cryptographic processing on constrained IoT devices, rendering its use infeasible. To close this gap, we tailor onion routing to the IoT by bridging protocol incompatibilities and offloading expensive cryptographic processing to a router or web server of the IoT device owner. Thus, we realize resource-conserving access control and end-toend security for IoT devices. To prove applicability, we deploy onion routing for the IoT within the well-established Tor network enabling IoT devices to leverage its resources to achieve the same grade of anonymity as readily available to traditional devices.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"1 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":"117144245","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}
Coleman Link, Jesse Sarran, Garegin Grigoryan, Minseok Kwon, M. M. Rafique, Warren R. Carithers
{"title":"Container Orchestration by Kubernetes for RDMA Networking","authors":"Coleman Link, Jesse Sarran, Garegin Grigoryan, Minseok Kwon, M. M. Rafique, Warren R. Carithers","doi":"10.1109/ICNP.2019.8888116","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888116","url":null,"abstract":"With the widespread usage of containerized virtualization in data centers and clouds, it is important to enabling high-throughput and zero-copy data transfer between those containers. Remote Direct Memory Access (RDMA) allows bypassing the kernel for packet processing by offloading it to specific RDMA-enabled NICs. The existing solutions enabling RDMA with containers are either based on custom container orchestrators (e.g., FreeFlow) or lack the ability for the control plane to manage the underlying RDMA traffic (e.g., Kubernetes RDMA plug-in via SR-IOV). The work in this paper builds off of previous work in Kubernetes to make an architecture that allows control over bandwidth requirements of RDMA within a Kubernetes cluster.","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":"122337988","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":"AutoWaze: Towards Automatic Event Inference in Intelligent Transportation Systems","authors":"Ning Wang, Yunsheng Wang","doi":"10.1109/ICNP.2019.8888059","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888059","url":null,"abstract":"Traffic monitoring is one of the key challenges in Intelligent Transportation Systems (ITS). In this paper, we propose to build a crowdsourcing application for traffic monitoring. The novelty of the proposed approach is that visual data is collected to enable automatic event inference with the recent advance in Computer Vision. The challenge is that mobile devices are not capable of handling visual task processing in high accuracy. We propose to build a networked system so that mobile devices can offload data via available wireless access interfaces (e.g., 4G LTE, WiFi, DSRC) to edge servers, e.g., GENI Rack. We plan to use the testbed at Kettering University to validate the proposed approach.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"570 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":"123398257","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}
G. Li, Menghao Zhang, Chang Liu, Xiao Kong, Ang Chen, G. Gu, Haixin Duan
{"title":"NETHCF: Enabling Line-rate and Adaptive Spoofed IP Traffic Filtering","authors":"G. Li, Menghao Zhang, Chang Liu, Xiao Kong, Ang Chen, G. Gu, Haixin Duan","doi":"10.1109/ICNP.2019.8888057","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888057","url":null,"abstract":"In this paper, we design NETHCF, a line-rate in-network system for filtering spoofed traffic. NETHCF leverages the opportunity provided by programmable switches to design a novel defense against spoofed IP traffic, and it is highly efficient and adaptive. One key challenge stems from the restrictions of the computational model and memory resources of programmable switches. We address this by decomposing the HCF system into two complementary components—one component for the data plane and another for the control plane. We also aggregate the IP-to-Hop-Count (IP2HC) mapping table for efficient memory usage, and design adaptive mechanisms to handle end-to-end routing changes, IP popularity changes, and network activity dynamics. We have built a prototype on a hardware Tofino switch, and our evaluation demonstrates that NETHCF can achieve line-rate and adaptive traffic filtering with low overheads.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"47 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":"124096504","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":"Hierarchical Congestion Control (HCC): Cooperation of Uncorrelated Flows for Better Fairness and Throughput","authors":"Shiva Ketabi, Y. Ganjali","doi":"10.1109/ICNP.2019.8888080","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888080","url":null,"abstract":"Congestion control protocols face several challenges for achieving max-min fairness and high throughput. First, each flow has a limited view of the network state. In the absence of a centralized congestion control entity, coordination is left (directly or indirectly) to individual flows. Second, most flows are very volatile by nature: flow rates/demands change significantly from one instant to another. In this poster, we present a hierarchical congestion control scheme to tackle these challenges. We aggregate flows with low correlation in a hierarchical manner, and recursively compute and allocate rates to these flows. Our preliminary experimental results show significant promise in terms of fairness and throughput.","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":"127547340","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}
Minh Nguyen, S. Debroy, P. Calyam, Zhen Lyu, T. Joshi
{"title":"Multi-Cloud Performance and Security-driven Brokering for Bioinformatics Workflows","authors":"Minh Nguyen, S. Debroy, P. Calyam, Zhen Lyu, T. Joshi","doi":"10.1109/ICNP.2019.8888071","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888071","url":null,"abstract":"Data-intensive bioinformatics applications often use federated multi-cloud infrastructures to support compute-intensive processing needs. In this paper, we propose a Multi-Cloud Performance and Security (MCPS) Brokering framework within such federated multi-cloud infrastructures to allocate cloud resources to applications by satisfying their performance and security requirements.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"295 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":"116371193","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":"Perseverance-Aware Traffic Engineering in Rate-Adaptive Networks with Reconfiguration Delay","authors":"Shih-Hao Tseng","doi":"10.1109/ICNP.2019.8888098","DOIUrl":"https://doi.org/10.1109/ICNP.2019.8888098","url":null,"abstract":"Expensive optical fibers provide connectivity for wide-area networks. Nowadays, the fibers are operated in a much conservative manner. By adaptively reconfiguring the fibers to exploit its signal quality, a recent proposal demonstrates a significant increase of optical link capacity. Such a reconfiguration currently accompanies a non-ignorable delay, during which the reconfigured link is not accessible, and the mentioned approach trades off the final throughput with the induced churn during the transition. This scheme can result in high traffic disturbance during the reconfiguration.To overcome the drawback of the simple churn-based update, we study the rate adaptation planning (RAP) problem under reconfiguration delay. We propose a multiple step planning with perseverance constraints. This approach leads to a smoother transition, but the optimal plan is shown NP-hard without constant factor approximation (unless P= NP). Therefore, we develop an efficient LP-based heuristic algorithm. Extensive simulations show that the algorithm gives 40 -50% higher throughput than the no-adaptive-link case. Also, the transition is much smoother: the resulting traffic fluctuation is only 40 -50% of the existing churn-based approach.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"43 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":"121127616","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}