2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)最新文献

筛选
英文 中文
Witness-Based Location Proofs for Mobile Devices 移动设备的基于证人的位置证明
J. Ferreira, M. Pardal
{"title":"Witness-Based Location Proofs for Mobile Devices","authors":"J. Ferreira, M. Pardal","doi":"10.1109/NCA.2018.8548244","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548244","url":null,"abstract":"Location-aware mobile applications are gaining popularity. This growth has caused the emergence of services that are offered to the users only when they are at specific locations. To implement valuable services, like a product sale, it is necessary to verify the presence of the user's device in a way which can be reliably trusted by the providers. This paper presents a system to support the creation of proofs that the user's device is at a claimed location. The system relies on different techniques for location estimation and on witness devices to testify to the presence of the user's device. A prototype was implemented and evaluated in regard to response times, accuracy of location estimates, and feasibility of proof exchanges. The results show that the solution is both practical and useful.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"17 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":"124030727","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}
引用次数: 18
Microservices: A Mapping Study for Internet of Things Solutions 微服务:物联网解决方案的映射研究
C. Santana, B. M. Alencar, Cássio V. S. Prazeres
{"title":"Microservices: A Mapping Study for Internet of Things Solutions","authors":"C. Santana, B. M. Alencar, Cássio V. S. Prazeres","doi":"10.1109/NCA.2018.8548331","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548331","url":null,"abstract":"The Internet of Things (IoT) involves the connectivity of a number of different physical and virtual devices, allowing the development of new services and applications. These intelligent objects, along with their tasks, constitute domain-specific applications (vertical markets), while ubiquitous and analytical services form domain-independent services (horizontal markets). The development of these applications and services in these markets brings challenges such as deployment, scalability, integration, interoperability, mobility and performance. Recent researches indicates that Microservices have been adopted in several domains such as IoT. This paper provides an overview of the current state of the art (studies selected by May 2018) regarding the adoption of Microservices in the development of IoT applications by means of the mapping study methodology. In this context, we present the eighteen selected studies, the existing contributions and the future research perspectives.","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":"126881878","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}
引用次数: 17
Scenario Design and Validation for Next Generation Cyber Ranges 下一代网络靶场的场景设计与验证
E. Russo, Gabriele Costa, A. Armando
{"title":"Scenario Design and Validation for Next Generation Cyber Ranges","authors":"E. Russo, Gabriele Costa, A. Armando","doi":"10.1109/NCA.2018.8548324","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548324","url":null,"abstract":"Cyber Ranges are (virtual) infrastructures for the execution of cyber exercises of the highest quality that simulate cyber scenarios of real-world complexity. Building the computing infrastructure is only the first step towards the successful execution of the cyber exercises. The design, validation, and deployment of scenarios are costly and error-prone activities that may require specialized personnel for weeks or even months. Furthermore, a misconfiguration in the resulting scenario can spoil the entire cyber exercise. In this paper, we propose a framework for automating the (i) design, (ii) model validation, (iii) generation and (iv) testing of cyber scenarios. We introduce a Scenario Definition Language (SDL) based on the OASIS Topology and Orchestration Specification for Cloud Applications (TOSCA). SDL allows for the high level, declarative specification of the components and their interplay. We show that SDL specifications can be encoded into Datalog and that this allows for the automatic checking of the resulting model against a set of validation goals. If the check fails, then a design modification process is triggered. Otherwise, the validated scenario can be automatically deployed on the cyber range. The validation proof is then automatically converted into test cases whose successful execution gives evidence that also the deployed scenario meets the validation goals.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"15 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":"127794074","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}
引用次数: 18
Virtualized Network Services Extension Algorithms 虚拟化网络服务扩展算法
Omar Houidi, Oussama Soualah, Wajdi Louati, D. Zeghlache, F. Kamoun
{"title":"Virtualized Network Services Extension Algorithms","authors":"Omar Houidi, Oussama Soualah, Wajdi Louati, D. Zeghlache, F. Kamoun","doi":"10.1109/NCA.2018.8548341","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548341","url":null,"abstract":"This work presents algorithms to extend tenant Virtualized Network Functions Forwarding Graphs (VNF-FG) to embed new networking functions and introduce gradually additional services into the already deployed tenant dedicated slices. The related service graph extension problem is addressed through an Integer Linear Programming (ILP) algorithm that serves as a reference for performance comparisons with a proposed heuristic algorithm. An eigendecomposition approach is proposed, evaluated and compared.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"44 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":"132615669","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}
引用次数: 3
Low-Reliable Low-Latency Networks Optimized for HPC Parallel Applications 为高性能计算并行应用优化的低可靠低延迟网络
Truong Thao Nguyen, Hiroki Matsutani, M. Koibuchi
{"title":"Low-Reliable Low-Latency Networks Optimized for HPC Parallel Applications","authors":"Truong Thao Nguyen, Hiroki Matsutani, M. Koibuchi","doi":"10.1109/NCA.2018.8548063","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548063","url":null,"abstract":"High-end network standards, such as 400GbE, have been introduced Forwarding Error Correction (FEC) for maintaining the same bit error rate (BER) as that in traditional low-bandwidth interconnection networks. However, FEC operation latency overhead surprisingly becomes higher than the sum of all the other switch operation overheads, e.g., routing computation and switch allocation. FEC operation latency overhead significantly degrades the performance of parallel applications in HPC systems. Instead, in this study, we exploit the low-latency network design using a Hamming code that does not provide rigid error-free communication. Since it is consistent with existing frame format based on standard Reed-Solomon RS(544,514) with DC(64b/66b) direct linecode and TC(256b/257b) transcode, respectively, the influences upon the other network layer design are limited. Interestingly, a large number of parallel applications can accept the BER in such a Hamming code. Since lowering such a BER improves switch operation latency, the proposed network using the Hamming code improves the execution time of NAS Parallel Benchmarks by 56% on average when compared to the counterpart RS-FEC networks.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"304 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113995776","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}
引用次数: 7
The Effect on Network Flows-Based Features and Training Set Size on Malware Detection 基于网络流的特征和训练集大小对恶意软件检测的影响
J. Jiménez, K. Goseva-Popstojanova
{"title":"The Effect on Network Flows-Based Features and Training Set Size on Malware Detection","authors":"J. Jiménez, K. Goseva-Popstojanova","doi":"10.1109/NCA.2018.8548325","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548325","url":null,"abstract":"Although network flows have been used in areas such as network traffic analysis and botnet detection, not many works have used network flows-based features for malware detection. This paper is focused on malware detection based on using features extracted from the network traffic and system logs. We evaluated the performance of four supervised machine learning algorithms (i.e., J48, Random Forest, Naive Bayes, and PART) for malware detection and identified the best learner. Furthermore, we used feature selection based on information gain to identify the smallest number of features needed for classification. In addition, we experimented with training sets of different sizes. The main findings include: (1) Adding network flows-based features improved significantly the performance of malware detection. (2) J48 and PART were the best performing learners, with the highest F-score and G-score values. (3) Using J48, the top five features ranked by information gain attained the same performance as when using all 88 features. In the case of PART, the top fourteen features ranked by information gain led to the same performance as when all 88 features were used. None of the system logs-based features were included in these two models. (4) The classification performance when training on 75% of the data was comparable to training on 90% of the data. As little as 25% of the data can be used for training at an expense of somewhat higher, but not very significant performance degradation (i.e., less than 7% for F-score and 6% for G-score compared to when 90% of the data were used for training).","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"82 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114059506","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
CSBAuditor: Proactive Security Risk Analysis for Cloud Storage Broker Systems CSBAuditor:云存储代理系统的主动安全风险分析
K. Torkura, M. Sukmana, Tim Strauss, Hendrik Graupner, Feng Cheng, C. Meinel
{"title":"CSBAuditor: Proactive Security Risk Analysis for Cloud Storage Broker Systems","authors":"K. Torkura, M. Sukmana, Tim Strauss, Hendrik Graupner, Feng Cheng, C. Meinel","doi":"10.1109/NCA.2018.8548329","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548329","url":null,"abstract":"Cloud Storage Brokers (CSB) provide seamless and concurrent access to multiple Cloud Storage Services (CSS) while abstracting cloud complexities from end-users. However, this multi-cloud strategy faces several security challenges including enlarged attack surfaces, malicious insider threats, security complexities due to integration of disparate components and API interoperability issues. Novel security approaches are imperative to tackle these security issues. Therefore, this paper proposes CS-BAuditor, a novel cloud security system that continuously audits CSB resources, to detect malicious activities and unauthorized changes e.g. bucket policy misconfigurations, and remediates these anomalies. The cloud state is maintained via a continuous snapshotting mechanism thereby ensuring fault tolerance. We adopt the principles of chaos engineering by integrating BrokerMonkey, a component that continuously injects failure into our reference CSB system, CloudRAID. Hence, CSBAuditor is continuously tested for efficiency i.e. its ability to detect the changes injected by BrokerMonkey. CSBAuditor employs security metrics for risk analysis by computing severity scores for detected vulnerabilities using the Common Configuration Scoring System, thereby overcoming the limitation of insufficient security metrics in existing cloud auditing schemes. CSBAuditor has been tested using various strategies including chaos engineering failure injection strategies. Our experimental evaluation validates the efficiency of our approach against the aforementioned security issues with a detection and recovery rate of over 96 %.","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":"123726986","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}
引用次数: 5
On the Consistent Migration of Splittable Flows: Latency-Awareness and Complexities 关于可分割流的一致迁移:延迟意识和复杂性
Klaus-Tycho Foerster
{"title":"On the Consistent Migration of Splittable Flows: Latency-Awareness and Complexities","authors":"Klaus-Tycho Foerster","doi":"10.1109/NCA.2018.8548339","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548339","url":null,"abstract":"Network traffic demands change all the time, giving rise to the well-investigated topic of consistent network updates. We in this paper study the consistent migration of flows, in particular the avoidance of transient congestion. Most previous work implemented rather coarse-grained techniques, ignoring the effect of link latency in their computations. Recent work shows that, in order to achieve the goal of zero packet loss, earlier methods need to be adapted to cope with link latency. However, the current work only considers unsplittable flows, which are routed along a single path. We present the first study of splittable flows in this context, where a single flow may be spread over the network for better throughput and load balancing. Interestingly, splittable flows seem to be harder to tackle in this setting from a complexity point of view. Nonetheless, we provide the first methods and insights to integrate splittable flows into consistent update frameworks under the aspect of link latencies.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"20 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":"123816300","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}
引用次数: 7
LoRaWAN Analysis Under Unsaturated Traffic, Orthogonal and Non-Orthogonal Spreading Factor Conditions 非饱和交通、正交和非正交扩频因子条件下的LoRaWAN分析
I. Korbi, Y. Ghamri-Doudane, L. Saïdane
{"title":"LoRaWAN Analysis Under Unsaturated Traffic, Orthogonal and Non-Orthogonal Spreading Factor Conditions","authors":"I. Korbi, Y. Ghamri-Doudane, L. Saïdane","doi":"10.1109/NCA.2018.8548056","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548056","url":null,"abstract":"LoRaWAN is the new transmission protocol for Low-Power Wide Areas (LPWA) networks. In addition to long range communications, one of the most solid arguments in favour of the LoRaWantechnology is its ability to operate at orthogonal spreading factors (SFs). This enables simultaneous transmissions at different data rates on the same frequency channel. But Recently, it has been shown that transmissions at different SFs are not perfectly orthogonal which generates cross-SF interferences (i.e. interferences between different spreading factors' transmissions). Therefore, we propose here an analytical model of a single cell LoRaWAN under unsaturated traffic, duty cycle and multi-channel deployment conditions. The model considers both perfect and imperfect SF orthogonality scenarios. The network performance are then derived in terms of achievable throughput at the gateway as a function of the offered load, the number of received packets per device and the percentage of successful transmissions. All the Results show that if spreading factors are assumed to be orthogonal, the capture effect improves the network performance in comparison with the theoretical pure Aloha access scheme. Whereas, the consideration of imperfect SF orthogonality revises the LoRaWAN performance downward.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"42 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":"115474000","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}
引用次数: 8
DTFA: A Dynamic Threshold-Based Fuzzy Approach for Power-Efficient VM Consolidation 基于动态阈值的虚拟机整合模糊方法
D. Alsadie, Eidah J. Alzahrani, N. Sohrabi, Z. Tari, Albert Y. Zomaya
{"title":"DTFA: A Dynamic Threshold-Based Fuzzy Approach for Power-Efficient VM Consolidation","authors":"D. Alsadie, Eidah J. Alzahrani, N. Sohrabi, Z. Tari, Albert Y. Zomaya","doi":"10.1109/NCA.2018.8548162","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548162","url":null,"abstract":"Dynamic virtual machine (VM) consolidation is considered an effective approach for improving power consumption and computing resource utilization in cloud-based data centers. However, the ever-changing workload in a data center makes it difficult for VM consolidation to prevent service level agreement (SLA) violations and optimize power consumption. Detection of overutilized and underutilized physical machines (PMs) plays a significant role in effective VM consolidation, immediately improving resource utilization, SLA violations, and power consumption. This paper presents a new proposal for the dynamic adjustment of threshold values that aims to minimize the number of migrations in varying workload environments. The proposed approach, named the ‘dynamic threshold-based fuzzy approach’ (DTFA), is a fuzzy threshold-based approach used for adjusting the threshold values of PMs in a cloud environment. The proposed approach allows the number of migrations caused by overloading to be reduced and SLAs to be met. Three sets of experiments with different workloads were conducted to validate the proposed approach. The results demonstrate that DTFA outperforms existing solutions by an average of 22.52%, 45.63% and 56.68% in power consumption, VM migration count, and SLA violations, respectively.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"37 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":"124750411","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}
引用次数: 14
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信