Luis Zabala, Rubén Solozabal, A. Ferro, Bego Blanco
{"title":"Model of a Virtual Firewall Based on Stochastic Petri Nets","authors":"Luis Zabala, Rubén Solozabal, A. Ferro, Bego Blanco","doi":"10.1109/NCA.2018.8548250","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548250","url":null,"abstract":"This paper presents a modeling of a virtual firewall, based on Stochastic Petri Nets (SPN) to analyze the performance in terms of throughput and delay. The firewall is part of a virtualized multitenant environment. To ensure that every tenant is protected against intrusion attempts, per tenant firewalls are a must. With this protection, each virtual environment located on a multitenant cloud is isolated and data is protected in case of an attack originating from within the cloud. Petri nets introduce some interactions that we have in the real system; we refer to sequential and parallel processing, concurrency, limited resources and mutual exclusion in shared resource access. The modeling is assessed by simulation and results are compared in different scenarios. The modeling also allows us to evaluate necessary resources that must be allocated to achive the desired throughput. Once the impact of key parameters on the global system performance is analyzed, results under several scenarios indicate that our proposal would succeed in an efficient resource allocation scheme in terms of throughput and delay.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123000588","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":"Device and User Management for Smart Homes","authors":"Alejandro Mazuera-Rozo, S. Rueda","doi":"10.1109/NCA.2018.8548328","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548328","url":null,"abstract":"In the context of smart homes, owners with no technical expertise will need to manage users and devices with various features to define who is allowed to use, or not, each smart device. To help owners perform this task, we designed a management framework that uses real life attributes and an attribute-based access control model (ABAC) to define access control policies. We built a prototype of the framework and found that users easily understand and use it to define access control policies for smart homes.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126454420","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":"Cluster Load Estimation for Stateless Schedulers in Datacenters","authors":"R. Alshahrani, H. Peyravi","doi":"10.1109/NCA.2018.8548337","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548337","url":null,"abstract":"In probe-based distributed schedulers, little information is known about the state of the cluster. As a result, there is uncertainty about the underlying resource demand and usage. To efficiently leverage cloud datacenters' resources while maintaining the expected performance, one must address the question of how to achieve a good and accurate estimation of the cluster utilization in a stateless manner. We propose a scalable and efficient algorithm to estimate cluster load with a predetermined margin of error and confidence level. This algorithm can be used by cloud service providers to improve resource management systems and to estimate resource utilization. Due to its simplicity, the algorithm can be used in probe-based schedulers such as Sparrow, Tarcil, Piper, and Hawk.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125733522","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}
Diego Fernández, Laura Vigoya, Fidel Cacheda, F. J. Nóvoa, Manuel F. López-Vizcaíno, V. Carneiro
{"title":"A Practical Application of a Dataset Analysis in an Intrusion Detection System","authors":"Diego Fernández, Laura Vigoya, Fidel Cacheda, F. J. Nóvoa, Manuel F. López-Vizcaíno, V. Carneiro","doi":"10.1109/NCA.2018.8548316","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548316","url":null,"abstract":"In this paper a systematic analysis of a public intrusion detection dataset has been developed in order to understand how the traffic behaves in this particular context. This analysis is used for avoiding common pitfalls introduced because of a misunderstanding of data peculiarities and for selecting and tailoring correctly the algorithms. Specifically, we have employed machine learning algorithms to classify the traffic into normal and attack flows. In addition, it is important to decide what features should be evaluated. Typically, standard metrics do not take into account time spent in the classification, what is essential in an intrusion detection system. This is the reason why we introduce a metric that considers both the accuracy and the delay to make the decision and that is employed for evaluating machine learning algorithms in other domains. The conclusions obtained from our dataset analysis can be used to develop new models that could fit the data better than existing approaches.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"135 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131172387","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":"Delivery Delay and Mobile Faults","authors":"Dimitris Sakavalas, Lewis Tseng","doi":"10.1109/NCA.2018.8548345","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548345","url":null,"abstract":"In this work we address the problem of reaching approximate consensus in a complete network of $n$ nodes, where message deliveries can be delayed by at most $d$ time-steps. We consider a mobile adversary, which corrupts at most $f$ nodes in any step, modeled as a synchronous round. We explicitly study how $d$ affects the feasibility of the problem. More precisely, we propose a framework to analyze mobile fault-tolerance in the presence of message delays. We prove that approximate consensus is feasible if and only if $n$ > 4df. We assume no knowledge of time (round index) by the nodes; instead, in our model, whenever a message is sent, it is timestamped by the communication channel. We propose the tight TimeStamps algorithm, which utilizes timestamps to optimally bound the number of faulty messages.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124954743","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 Holistic Approach to Efficient HPC, Networking and Storage for Science","authors":"A. Bode","doi":"10.1109/NCA.2018.8548320","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548320","url":null,"abstract":"","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126671501","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}
Jonathan Roux, E. Alata, G. Auriol, M. Kaâniche, V. Nicomette, Romain Cayre
{"title":"RadIoT: Radio Communications Intrusion Detection for IoT - A Protocol Independent Approach","authors":"Jonathan Roux, E. Alata, G. Auriol, M. Kaâniche, V. Nicomette, Romain Cayre","doi":"10.1109/NCA.2018.8548286","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548286","url":null,"abstract":"Internet-of-Things (IoT) devices are nowadays massively integrated in daily life: homes, factories, or public places. This technology offers attractive services to improve the quality of life as well as new economic markets through the exploitation of the collected data. However, these connected objects have also become attractive targets for attackers because their current security design is often weak or flawed, as illustrated by several vulnerabilities such as Mirai, Blueborne, etc. This paper presents a novel approach for detecting intrusions in smart spaces such as smarthomes, or smartfactories, that is based on the monitoring and profiling of radio communications at the physical layer using machine learning techniques. The approach is designed to be independent of the large and heterogeneous set of wireless communication protocols typically implemented by connected objects such as WiFi, Bluetooth, Zigbee, Bluetooth-Low-Energy (BLE) or proprietary communication protocols. The main concepts of the proposed approach are presented together with an experimental case study illustrating its feasibility based on data collected during the deployment of the intrusion detection approach in a smart home under real-life conditions.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122323993","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":"On the Fly Detection of the Top-K Items in the Distributed Sliding Window Model","authors":"E. Anceaume, Yann Busnel, Vasile Cazacu","doi":"10.1109/NCA.2018.8548097","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548097","url":null,"abstract":"This paper presents a new algorithm that detects on the fly the $k$ most frequent items in the sliding window model. This algorithm is distributed among the nodes of the system. It is inspired by a recent and innovative approach, which consists in associating a stochastic value correlated with the item's frequency instead of trying to estimate its number of occurrences. This stochastic value corresponds to the number of consecutive heads in coin flipping until the first tail occurs. The original approach was to retain just the maximum of consecutive heads obtained by an item, since an item that often occurs will have a higher probability of having a high value. While effective for very skewed data distributions, the correlation is not tight enough to robustly distinguish items with comparable frequencies. To address this important issue, we propose to combine the stochastic approach together with a deterministic counting of items. Specifically, in place of keeping the maximum number of consecutive heads obtained by an item, we count the number of times the coin flipping process of an item has exceeded a given threshold. This threshold is defined by combining theoretical results in leader election and coupon collector problems. Results on simulated data show how impressive is the detection of the top-k items in a large range of distributions.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134441379","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":"Tamper-Proof Incentive Scheme for Mobile Crowdsensing Systems","authors":"Diogo Calado, M. Pardal","doi":"10.1109/NCA.2018.8548093","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548093","url":null,"abstract":"People are increasingly connected to the Internet through their smartphones and each of these mobile devices has a wide range of sensors. The users themselves can be asked short questions about what they see. This crowdsensing has the potential to improve our daily lives by providing actual data about the environment and the use of services. However, there are significant obstacles to user participation like resource consumption and privacy concerns. There is a need for incentives to motivate the users. In this paper, we propose a tamper-proof incentive scheme for a mobile crowdsensing system that supports open sensing, with both automated and manual participation. We implemented a prototype of the system with server components and a mobile application. The proposed incentive scheme implements a tit-for-tat approach: positive user participation is rewarded with points that are stored in a shared record. This incentive ledger uses a Blockchain so that it can be trusted by every participant. The evaluation results show that the proposed scheme is practical and can be used to motivate increased participation in crowdsensing.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115749834","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":"TorBot Stalker: Detecting Tor Botnets Through Intelligent Circuit Data Analysis","authors":"Oluwatobi Fajana, Gareth Owenson, Ella Haig","doi":"10.1109/NCA.2018.8548313","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548313","url":null,"abstract":"Botnets are collections of infected computers that are controlled centrally by a botmaster, often for sending spam or launching denial of service attacks. The task to take down these botnets is often a cat and mouse game with operators frequently changing domains for their control infrastructure. More recently, operators have moved to using Tor, a pseudo-anonymous network for hosting services whereby identification is difficult. Additionally, because connections to the Tor network are encrypted, we cannot use traditional methods like Domain Name System (DNS) and traffic signatures to detect infected hosts. In this paper, we introduce TorBot Stalker: the first mechanism for detecting, de-anonymizing, and destroying Tor botnets. We use machine learning to analyse and fingerprint the timings and frequency of Tor network circuit data when routing botnet traffic, and build a detection mechanism that is able to identify infected hosts at the Tor network border, in real-time, while preserving the privacy of legitimate users. TorBot Stalker can be implemented at any node in the Tor network and can differentiate between botnets and legitimate applications like Internet Relay Chat (IRC) coming from the same host. Experimental data demonstrates an accuracy of 99% with few false positives. We then apply the technique at the entry to the Tor network to measure the fraction of traffic which is for botnet. We observed that Torbot Stalker is able to de-anonymize real botnets in the Tor network and further identify infected hosts and control servers.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128102438","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}