{"title":"SETA: Scalable Encrypted Traffic Analytics in Multi-Gbps Networks","authors":"Kwon Nung Choi, Achintha Wijesinghe, C. Kattadige, Kanchana Thilakarathna, Suranga Seneviratne, Guillaume Jourjon","doi":"10.1109/LCN48667.2020.9314837","DOIUrl":"https://doi.org/10.1109/LCN48667.2020.9314837","url":null,"abstract":"While end-to-end encryption brings security and privacy to the end-users, it makes legacy solutions such as Deep Packet Inspection ineffective. Despite the recent work in machine learning-based encrypted traffic classification, these new techniques would require, if they were to be deployed in real enterprise-scale networks, an enhanced flow sampling due to sheer volume of data being traversed. In this paper, we propose a holistic architecture that can cope with encryption and multi-Gbps line rate with sampling and sketching flow statistics, which allows network operators to both accurately estimate the flow size distribution and identify the nature of VPN-obfuscated traffic. With over 6000 video traffic traces, we show that it is possible to achieve 99% accuracy for service provider classification even with sampled possibly inaccurate data.","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114801157","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}
Pavlo Gaiduk, K. Ranjan, T. Basmer, Florian Tschorsch
{"title":"Privacy-Preserving Public Key Infrastructure for Vehicular Networks","authors":"Pavlo Gaiduk, K. Ranjan, T. Basmer, Florian Tschorsch","doi":"10.1109/LCN48667.2020.9314787","DOIUrl":"https://doi.org/10.1109/LCN48667.2020.9314787","url":null,"abstract":"Cooperative intelligent transport systems promise considerable improvements on road safety and the utilization of transport infrastructures. Current approaches, however, build upon policies to protect privacy, which raise serious concerns. In this paper, we propose a privacy-preserving public key infrastructure (PKI) for vehicle-to-everything communication. We use zero-knowledge proofs to authenticate, while still being able to hide identities. In order to exclude malicious actors, we integrate an anonymous reputation-based blacklisting scheme. Our benchmarks on an on-board connectivity unit with resource-constrained hardware confirms the feasibility of the approach. Specifically, we expect approximately 67 kB payload and 35 minutes computation time per day to authenticate.","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126209615","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}
Jason Posner, Lewis Tseng, M. Aloqaily, M. Guizani
{"title":"Federated Vehicular Networks: Design, Applications, Routing, and Evaluation","authors":"Jason Posner, Lewis Tseng, M. Aloqaily, M. Guizani","doi":"10.1109/LCN48667.2020.9314811","DOIUrl":"https://doi.org/10.1109/LCN48667.2020.9314811","url":null,"abstract":"In this paper, we propose a new concept of vehicular networks, namely a Federated Vehicular Networks (FVN), which can be viewed as a stationary vehicular cloud. We first identify the motivation – namely the limits of traditional vehicular clouds due to their instability and rapidly changing topology – and then present the design and applications of an FVN. Finally, we model and describe the unique routing problem in FVN, and present and evaluate different routing algorithms.","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134559640","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":"Cloud-based Deception against Network Reconnaissance Attacks using SDN and NFV","authors":"Abdullah Aydeger, Nico Saputro, K. Akkaya","doi":"10.1109/LCN48667.2020.9314797","DOIUrl":"https://doi.org/10.1109/LCN48667.2020.9314797","url":null,"abstract":"An attacker's success crucially depends on the reconnaissance phase of Distributed Denial of Service (DDoS) attacks, which is the first step to gather intelligence. Although several solutions have been proposed against network reconnaissance attacks, they fail to address the needs of legitimate users' requests. Thus, we propose a cloud-based deception framework which aims to confuse the attacker with reconnaissance replies while allowing legitimate uses. The deception is based on for-warding the reconnaissance packets to a cloud infrastructure through tunneling and SDN so that the returned IP addresses to the attacker will not be genuine. For handling legitimate requests, we create a reflected virtual topology in the cloud to match any changes in the original physical network to the cloud topology using SDN. Through experimentations on GENI platform, we show that our framework can provide reconnaissance responses with negligible delays to the network clients while also reducing the management costs significantly.","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133340500","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":"Flow Control in the Context of the Multiplexed Transport Protocol QUIC","authors":"E. Volodina, E. Rathgeb","doi":"10.1109/LCN48667.2020.9314796","DOIUrl":"https://doi.org/10.1109/LCN48667.2020.9314796","url":null,"abstract":"QUIC is a novel transport protocol developed to solve some of the well-known problems in Internet data transfer. QUIC can separately manage data of multiple distinct flows (streams) within a QUIC connection. In contrast to other protocols, like e.g. SCTP, it also uses data Flow Control (FC) on the stream as well as the connection level. The QUIC FC uses a credit-based scheme on both levels. In order to evaluate the QUIC performance in detail, we implemented a QUIC simulation model featuring Congestion Control (CC) and FC according to the current standard [11]. During our evaluation, we observed suboptimal behavior of the credit-based FC algorithm, resulting in a significant degradation of the throughput of the entire connection and the goodput of each stream in the QUIC data transfer. In this paper, we propose some modifications to the credit-based FC scheme and show by means of simulation that these modifications completely mitigate the issues and enable achieving the optimum performance in FC-limited scenarios. We further show that the improved FC correctly cooperates with Congestion Control and Retransmission mechanisms and has no negative impact on the protocol performance in cases where the latter mechanisms dominate the protocol behavior.","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132847987","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}
Amina Bensalem, D. E. Boubiche, Fen Zhou, A. Rachedi, A. Mellouk
{"title":"Impact of Mobility Models on Energy Consumption in Unmanned Aerial Ad-Hoc Network","authors":"Amina Bensalem, D. E. Boubiche, Fen Zhou, A. Rachedi, A. Mellouk","doi":"10.1109/LCN48667.2020.9314832","DOIUrl":"https://doi.org/10.1109/LCN48667.2020.9314832","url":null,"abstract":"Unmanned Aerial Ad-hoc Networks (UAANETs) pushed up UAVs’ cooperative tasks. For efficient cooperation, a fitting mobility pattern must be adopted, ensuring simple, flexible, and easy-manageable coordination. Indeed, UAANET faces an inescapable challenge due to the limited energy constraint, which significantly affects the tasks’ productivity and efficiency. Different from the literature, which only studied the impact of two classical factors affecting energy consumption, namely, communication protocols and computation, we highlight the impact of the temporal and spatial correlation involved in mobility models. Indeed, we consider a transitive relationship taking place between temporal and spatial correlation and energy consumption. Those correlation forms do affect the data loss ratio that, in turn, augments energy consumption due to the increased rate of data re-transmission, route re-discovery and maintenance, etc. On this basis, we assume the temporal and spatial correlation impact on energy consumption, which has been demonstrated and analyzed through numerical simulations.","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123405240","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":"Transmission Timing Control to Avoid Collisions Among Both Aperiodic and Periodic Packets in Wireless Sensor Networks","authors":"A. Koyama, Y. Tanigawa, H. Tode","doi":"10.1109/LCN48667.2020.9314776","DOIUrl":"https://doi.org/10.1109/LCN48667.2020.9314776","url":null,"abstract":"Currently, many kinds of wireless sensor networks need to communicate aperiodically generated packets like event detection as well as periodically generated ones for environmental, vital monitoring, and so on. Thus, collisions should be avoided among both aperiodic and periodic packets. In this paper, we propose a method to schedule transmission timings of aperiodic and periodic packets at the application layer from the source nodes. This has advantages of no modification to the MAC layer standardized by IEEE 802.11, 802.15.4, etc. and low cost of sensor nodes, compared with existing approaches based on the MAC layer modifications. To the best of our knowledge, this is the first proposal that controls transmission timings of both aperiodically and periodically generated packets at the application layer. Performance evaluation verifies that the proposed method improves packet loss rate compared with existing application layer approaches that control transmission timings of only periodic packets.","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123609212","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}
H. Shirazi, Shashika R. Muramudalige, I. Ray, A. Jayasumana
{"title":"Improved Phishing Detection Algorithms using Adversarial Autoencoder Synthesized Data","authors":"H. Shirazi, Shashika R. Muramudalige, I. Ray, A. Jayasumana","doi":"10.1109/LCN48667.2020.9314775","DOIUrl":"https://doi.org/10.1109/LCN48667.2020.9314775","url":null,"abstract":"Malicious actors often use phishing attacks to compromise legitimate users’ credentials. Machine learning is a promising approach for phishing detection. While the accuracy of machine learning algorithms is often dependent on the training data, very little attack data for training is available. We propose an approach for augmenting existing datasets that can be used by machine learning algorithms. We use an Adversarial Autoencoder (AAE) to generate samples that mimic the phishing websites and provide metrics to assess the quality of the generated samples. We test these samples against models trained with real-world data. Some of generated samples are able to evade existing detection model. We then use a portion of these samples in training. The new machine learning models are more robust and have higher accuracy. In other words, real-world phishing site data augmented with AAE synthesized data used for training the model is more effective for phishing detection.","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122436031","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":"Improvement and Implementation of a Multi-Path Management Algorithm based on MPTCP","authors":"Min Chen, T. Dreibholz, Xing Zhou, Xuelei Yang","doi":"10.1109/LCN48667.2020.9314778","DOIUrl":"https://doi.org/10.1109/LCN48667.2020.9314778","url":null,"abstract":"The core idea of the Multi-Path Transmission Control Protocol (MPTCP) is to utilize multiple network connections by distributing payload data transmission among several sub-flows. Then, multiple paths in the underlying networks can be used to maximize the overall connection throughput. However, the concurrent transmission on only a subset of all possible sub-flows’ aggregation can improve network performance, because of performance differences between the subflow. In this paper, we propose a new FullMesh algorithm based on Path Characteristic and Data Characteristic (PCDC), in which a Subflow Impact Factor (IF) is used as a subflow characteristic to predict the impact of a subflow on the overall throughput. Then, different path sets are adopted for different sizes of traffic. The PCDC algorithm is evaluated in the NORNET CORE testbed, comparing it to the FullMesh algorithm. Our research results show that the PCDC algorithm can improve the network throughput and reduce the overall completion time of small data streams. 1 2 3","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125994326","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}