2018 International Symposium on Networks, Computers and Communications (ISNCC)最新文献_第9页

A Fault Tolerant Approach for Malicious URL Filtering 一种恶意URL过滤的容错方法

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8530984

Mansoor Ahmed, Abid Khan, Osama Saleem, Muhammad Haris

{"title":"A Fault Tolerant Approach for Malicious URL Filtering","authors":"Mansoor Ahmed, Abid Khan, Osama Saleem, Muhammad Haris","doi":"10.1109/ISNCC.2018.8530984","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530984","url":null,"abstract":"Existing URL filtering mechanisms lacks support for real-time fault tolerance and scalability. In this paper these issues are addressed by developing a scalable model which is real time and fault tolerant to classify streams of URL traffic. The key feature of our model is that it saves computation time, resources usage and bandwidth. This model is implemented in Apache Spark which runs APIs for machine learning and streaming. The dataset consists of 2.4 million URLs which were taken from both clean and malicious classes. In training set, clean URLs are labeled as 1 and malicious are labeled as 0. For this proposed model, distributed in-memory computation is provided by Apache Spark's resilient distributed datasets (RDD) in fault tolerant manner. By increasing number of nodes in the cluster we achieved linear scalability. Our model attained an accuracy of 96% on logistic regression classifier and scaled up well with the Apache Spark's cluster. In 55 second using logistic regression classifier from Spark ML1ib, 2 million URLs can be filtered. The model achieved fl-score values of 0.92, 0.95 and 0.93 along with precision and the results are evaluated using cross-validation schemes.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123230876","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}

引用次数: 4

A Suboptimal Routing Algorithm for Massive LEO Satellite Networks 大规模LEO卫星网络的次优路由算法

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8530894

Yilun Liu, Lidong Zhu

{"title":"A Suboptimal Routing Algorithm for Massive LEO Satellite Networks","authors":"Yilun Liu, Lidong Zhu","doi":"10.1109/ISNCC.2018.8530894","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530894","url":null,"abstract":"In a massive Low Earth Orbit(LEO) satellite network without inter-satellite links(ISLs), connection between source node and destination node can be established through satellite-ground links. Utilizing satellite network topology in time virtualization algorithm and assuming that the current traffic of satellite-ground links which is used as the value of the topology correlation matrix can be perceived, the network uses the Dijkstra algorithm to obtain the shortest path of the current total network traffic and thus implements load balancing of the constellation system. Due to the large number of satellites, the network topology is complex and time varying, it is difficult to find the optimal path in a short time, so a suboptimal routing algorithm based on network topology is proposed in this paper. The local network topology is obtained by using the positions of the source and destination gateway, and the number of satellites and gateways used to establish the correlation matrix of the Dijkstra algorithm is reduced. Through the simulation analysis, the average computational complexity of this algorithm is much lower than that of the global optimal routing algorithm, and the average propagation delay of routing is almost the same. When the network load is normal, the system performance is almost the same with the global optimal routing algorithm.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123838017","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}

引用次数: 10

A Cluster-Based Mobile Data-Gathering Scheme for Underwater Sensor Networks 一种基于集群的水下传感器网络移动数据采集方案

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8531067

S. Ghoreyshi, A. Shahrabi, T. Boutaleb

引用次数: 6

Performance Evaluation of a Virtualized 5G Core Network in Indoor Environments 室内环境下虚拟化5G核心网性能评估

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8530923

Bong-Hwan Oh, S. Vural, Yogaratnam Rahulan, Ning Wang, R. Tafazolli

引用次数: 1

Enhancing 802.11ac Dynamic Access method for Increasing the Throughput of Low Priority Access Categories BK and BE 改进802.11ac动态接入方法，提高低优先级接入类别BK和BE的吞吐量

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8530896

Souhila Mammeri, M. Yazid, L. Bouallouche-Medjkoune, Thanina Belkhir

{"title":"Enhancing 802.11ac Dynamic Access method for Increasing the Throughput of Low Priority Access Categories BK and BE","authors":"Souhila Mammeri, M. Yazid, L. Bouallouche-Medjkoune, Thanina Belkhir","doi":"10.1109/ISNCC.2018.8530896","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530896","url":null,"abstract":"Wireless Local Area Networks (WLANs) are becoming an essential form of communication in our life, and they have known a strong history of development. The current IEEE 802.11ac technology aims at achieving a Very High Throughput (VHT), by utilizing wider channels 80 and 160 MHz. The wide channels are obtained by bonding adjacent 20 MHz sub-channels. This is why, Static and Dynamic Multichannel Access (SMA and DMA) methods are proposed for controlling such multichannel transmissions. SMA and DMA guarantee the requirements of Quality of Service (QoS) for VHT WLANs, by following the existing 802.11e Enhanced Distributed Channel Access (EDCA). However, EDCA still suffers from the starvation among low priority ACs. Although several enhancements have been proposed since the emergence of the starvation issue, none of the proposed research works have addressed the critical state of low priority ACs BestEffort (BE) and BacKground (BK) under wide channels. In this paper, we propose to enhance the DMA method, in order to improve the multichannel access efficience and hence increase the throughputs of BK and BE. The obtained simulation results demonstrate the contribution of the Starvation resolution within the DMA method (SDMA) for increasing the throughputs of low priority ACs while maintaining the throughputs of high priority ACs.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124122631","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}

引用次数: 1

Small Size, High Power Density, Solid State Amplifiers for Space Application 小尺寸，高功率密度，固态放大器的空间应用

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8531030

D. Passi, A. Leggieri, Alessio Mattioni, F. Paolo, M. D'Antoni, M. Bartocci, E. Ciacia, A. Tafuto

引用次数: 3

Building a Traffic Policer for DDoS Mitigation on Top of Commodity Hardware 在商品硬件之上构建DDoS缓解流量策略

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8531043

Erkin Kirdan, Daniel Raumer, Paul Emmerich, G. Carle

{"title":"Building a Traffic Policer for DDoS Mitigation on Top of Commodity Hardware","authors":"Erkin Kirdan, Daniel Raumer, Paul Emmerich, G. Carle","doi":"10.1109/ISNCC.2018.8531043","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531043","url":null,"abstract":"Traffic policing is the process of ensuring that network traffic complies with its policies with methods like traffic shaping. As the distribution of sources involved in a DDoS attack differs significantly from the typical distribution of customers for web services, traffic shapers and policers can be used in DDoS mitigation. In the past, software-based middleboxes, like traffic shapers, easily became overloaded and therefore a vulnerability for DDoS attacks. Although recent advances in network stack design on commodity hardware increased the performance, the software on top of the network stack also needs to provide adequate throughput and scalability regarding the number of limited subnets. Therefore, we build a high-performance and scalable traffic policer called MoonPol and evaluated it in a DDoS mitigation scenario. MoonPol runs on any commodity hardware, takes advantage of the underlying framework, DPDK, and combines it with appropriate algorithms and data structures. Data structures for efficient lookups are implemented together with the token bucket algorithm to police a traffic of fine-grained IP address ranges. Benchmarking results show that the single core throughput of the policer running on a 3.2 GHz CPU, is 6.5 Mpps with limiting 1 Million subnets, i.e., 492 CPU cycles per packet. With 250K subnets of all countries in the world, the throughput is 6.66 Mpps.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123270151","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}

引用次数: 2

Cyber-physical Threats and Vulnerabilities Analysis for Train Control and Monitoring Systems 列车控制与监控系统的网络物理威胁与漏洞分析

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8531005

M. Rekik, C. Gransart, M. Berbineau

引用次数: 5

Security for Internet of Things: The SerIoT Project 物联网安全:SerIoT项目

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8531004

E. Gelenbe, J. Domańska, T. Czachórski, A. Drosou, D. Tzovaras

引用次数: 30

Discovering True Kids Mobile Behavior 发现孩子真正的手机行为

2018 International Symposium on Networks, Computers and Communications (ISNCC) Pub Date : 2018-06-01 DOI: 10.1109/ISNCC.2018.8530884

Massimo Marchiori

{"title":"Discovering True Kids Mobile Behavior","authors":"Massimo Marchiori","doi":"10.1109/ISNCC.2018.8530884","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530884","url":null,"abstract":"The mobile world has freed individuals from many physical constraint, but has also added degrees of freedom that might amplify privacy and security problems, especially for a critical part of the population: underage children. How much of this freedom is a risk for our kids? The problem is that we do not really know yet the answer to this question. Knowing what kids really do with their smartphone is not an easy task: we can try to get a grasp of their actions using questionnaires, but this introduces bias when trying to measure inappropriate behavior, even more in the kids world due to additional factors like shame. In this paper we report on an attempt to shed light on this problem, and to delve deep into the true world of kids. We first state what the problems are when trying to analyze their mobile behavior, identify the critical technical challenges, and show that there is also a number of non-technical challenges making up for a significant barrier. We then design and implement a system able to overcome a good number of these challenges, and effectively study the unfiltered behavior of kids in the mobile world, and so to check the potential risks for privacy and security during their mobile interactions. A large pool of kids is then studied, shading new light on the potentially dangerous zones that underage kids cross every day, and showing how truly dangerous the mobile environment, in its present technological and social shape, is for our children.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125130076","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}

引用次数: 1