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

Message from the Steering Committee Chair and General Chair of IEEE NCA2018 IEEE NCA2018指导委员会主席和总主席的致辞

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) Pub Date : 2018-11-01 DOI: 10.1109/nca.2018.8548059

引用次数: 0

Nonintrusive Monitoring of Microservice-Based Systems 基于微服务的系统的非侵入式监控

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) Pub Date : 2018-11-01 DOI: 10.1109/NCA.2018.8548311

F. Pina, Jaime Correia, R. Filipe, Filipe Araújo, Jorge Cardroom

{"title":"Nonintrusive Monitoring of Microservice-Based Systems","authors":"F. Pina, Jaime Correia, R. Filipe, Filipe Araújo, Jorge Cardroom","doi":"10.1109/NCA.2018.8548311","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548311","url":null,"abstract":"Breaking large software systems into smaller functionally interconnected components is a trend on the rise. This architectural style, known as “microservices”, simplifies development, deployment and management at the expense of complexity and observability. In fact, in large scale systems, it is particularly difficult to determine the set of microservices responsible for delaying a client's request, when one module impacts several other microservices in a cascading effect. Components cannot be analyzed in isolation, and without instrumenting their source code extensively, it is difficult to find the bottlenecks and trace their root causes. To mitigate this problem, we propose a much simpler approach: log gateway activity, to register all calls to and between microservices, as well as their responses, thus enabling the extraction of topology and performance metrics, without changing source code. For validation, we implemented the proposed platform, with a microservices-based application that we observe under load. Our results show that we can extract relevant performance information with a negligible effort, even in legacy systems, where instrumenting modules may be a very expensive task.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"8 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":"115847209","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}

引用次数: 24

Practical and Fast Causal Consistent Partial Geo-Replication 实用和快速的因果一致部分地理复制

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) Pub Date : 2018-11-01 DOI: 10.1109/NCA.2018.8548067

Pedro Fouto, J. Leitao, Nuno M. Preguiça

{"title":"Practical and Fast Causal Consistent Partial Geo-Replication","authors":"Pedro Fouto, J. Leitao, Nuno M. Preguiça","doi":"10.1109/NCA.2018.8548067","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548067","url":null,"abstract":"Distributed storage systems are a fundamental component of large-scale Internet services. To keep up with the increasing expectations of users regarding availability and latency, the design of data storage systems has evolved to achieve these properties by exploiting techniques such as partial replication, geo-replication, and weaker consistency models. How to combine all these techniques in a single solution in a practical and efficient way is highly challenging. In this paper we propose a novel replication scheme that can offer causal+ consistency in a geo-distributed scenario with partial replication, where datacenters replicate different portions of the entire database. We leverage on a recently proposed methodology that decouples the propagation of data and causality-tracking metadata. Our solution presents a novel causal consistency tracking and enforcing algorithm, focusing on maximizing parallelism in the execution of remote operations which, as we show, has a significant influence on the performance of a partially replicated system. We also propose and implement a design to integrate our solution in the popular Cassandra database. Experimental results show that, by exploring a new position in the trade-off between throughput and data visibility (by balancing the execution of local and remote operations, respectively), our solution presents overall good performance.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"28 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":"123906052","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}

引用次数: 16

Online Workload Scheduling for Green Cloud Data Center with Delay Guarantee in Smart Grid 智能电网中时延保证的绿色云数据中心在线工作负载调度

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) Pub Date : 2018-11-01 DOI: 10.1109/NCA.2018.8548190

Huaiwen He, Hong Shen

{"title":"Online Workload Scheduling for Green Cloud Data Center with Delay Guarantee in Smart Grid","authors":"Huaiwen He, Hong Shen","doi":"10.1109/NCA.2018.8548190","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548190","url":null,"abstract":"Many cloud center operators are turning to leverage on-site renewable energy to reduce power cost for sustainable development consideration. But how to effectively coordinate the intermittent renewable energy with the workload remains to be a great challenge. This paper investigates the problem of power cost minimization under the constraints of different SLAs of delay-tolerant workload and non-delay workload for green data center in smart grid. To handle the randomness of workload, electricity price and renewable energy availability, we formulate a constrained stochastic problem with the consideration of the affection of zero price in smart grid. Then we propose a low-complexity Online workload Scheduling algorithm with Delay Guarantee (OSDG) which makes online scheduling decision based on the system current state and guarantees a bounded worst scheduling delay for delay-tolerant workload. The rigorous theoretical analysis demonstrates that our algorithm achieves a [0 (1/v), O (V)] cost-delay tradeoff. Extensive simulations based on real-world trace are done to evaluate the performance of our algorithm in reality. The results show that OSDG achieves about 4.9% improvement compared with the baseline algorithms.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"49 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":"121640191","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

Securing WirelessHART: Monitoring, Exploring and Detecting New Vulnerabilities 保护无线shart:监测，探索和检测新的漏洞

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) Pub Date : 2018-11-01 DOI: 10.1109/NCA.2018.8548060

Duarte M. G. Raposo, A. Rodrigues, S. Sinche, J. Silva, F. Boavida

{"title":"Securing WirelessHART: Monitoring, Exploring and Detecting New Vulnerabilities","authors":"Duarte M. G. Raposo, A. Rodrigues, S. Sinche, J. Silva, F. Boavida","doi":"10.1109/NCA.2018.8548060","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548060","url":null,"abstract":"Industrial Control Systems are now exploring the use of Internet of Things technologies not only to make them fitter to their job but also to explore the advantages that come from connecting them to the Internet. Nevertheless, with this paradigm shift, new threats appear, of which the stuxnet worm is just an example, and Intrusion Detection Systems architectures and solutions were and still are being considered. However, most existing projects concentrate on high level system aspects and thus neglect security aspects at wireless communication standards level, such as WirelessHART (the standard with largest market share), choosing not to address security solutions to common, known attacks identified by the community. In this paper, using a monitoring architecture proposed in our previous work, we will monitor a WirelessHART testbed, and at the same time, conduct network attacks from an outsider perspective. As main contributions this paper presents a new exhaustion attack for WirelessHART that, until now, to the best of our knowledge, has not been yet described. Additionally, the presented work proves that using classifiers like One Class Support Vector Machines (OSVM), and our monitoring architecture we are capable to detect the new exhaustion attack and more common attacks like jamming and collision.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"58 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":"122026795","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}

引用次数: 6

Sensing Trees in Smart Cities with Open-Design Hardware 用开放设计硬件感知智慧城市中的树木

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) Pub Date : 2018-11-01 DOI: 10.1109/NCA.2018.8548274

Antonio Deusany de Carvalho Junior, Victor Seiji Hariki, A. Goldman

{"title":"Sensing Trees in Smart Cities with Open-Design Hardware","authors":"Antonio Deusany de Carvalho Junior, Victor Seiji Hariki, A. Goldman","doi":"10.1109/NCA.2018.8548274","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548274","url":null,"abstract":"Tree fall is a major issue in large cities as it may obstruct roads and lead to traffic jams, and even injure people. Following these kind of incidents, monitoring the environment through sensors and Internet of Things technologies emerges as an important preventive approach. Another point is that the net primary productivity has a sensitive relation with trees characteristics including plant respiration and net photosynthesis which are highly sensitive to temperature. The health of the tree can then be monitored through leaf transpiration, sap flow measurement, environment evaluation as these methods offer indicators on any chance of a fall. The solution proposed in this paper includes an open-design hardware setup for monitoring trees in Smart Cities with Internet of Things. The setup is connected to a Smart City platform aiming to facilitate the use by other researchers and botanics, specially. Therefore, we noticed that the daily sensing data results in a huge amount of information that requires a balance between Big Data and Edge Computing approaches to process the whole collected data. The evaluation of the sensing data is presented together with the proposed architecture.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"40 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":"128938057","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}

引用次数: 0

Efficient Multi-Hop Broadcasting in Dense Nanonetworks 密集纳米网络中高效的多跳广播

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) Pub Date : 2018-11-01 DOI: 10.1109/NCA.2018.8548058

Thierry Arrabal, D. Dhoutaut, Eugen Dedu

{"title":"Efficient Multi-Hop Broadcasting in Dense Nanonetworks","authors":"Thierry Arrabal, D. Dhoutaut, Eugen Dedu","doi":"10.1109/NCA.2018.8548058","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548058","url":null,"abstract":"Broadcasting is a widely used dissemination technique in wireless multi-hop networks. The simplest broadcasting technique, the pure flooding, is quite inefficient in terms of number of packets generated. Whereas numerous ways to optimize it in classical networks have been proposed, we found no proposition appropriate for very dense networks (nodes having thousands of neighbors or more) with resource-constrained nodes. Typically, nodes have to prevent the broadcast storm problem using only a partial or even no information about their neighborhood due to memory scarcity. At the same time, they have to avoid the die out problem commonly found in broadcasting techniques. In this article we propose an efficient broadcasting scheme for dense nanonetworks. It combines an estimator of the number of neighbors, a backoff window and a counter of packets. We explain why this method is efficient in dense networks. Based on simulation results, we show that on a random dense network it reduces by 71% the number of packets exchanged in the network compared to an optimized method found in the literature, while at the same time avoiding the die out problem.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"199 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":"133623983","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}

引用次数: 15

ProductChain: Scalable Blockchain Framework to Support Provenance in Supply Chains ProductChain:可扩展的区块链框架，以支持供应链中的来源

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) Pub Date : 2018-11-01 DOI: 10.1109/NCA.2018.8548322

Sidra Malik, S. Kanhere, R. Jurdak

{"title":"ProductChain: Scalable Blockchain Framework to Support Provenance in Supply Chains","authors":"Sidra Malik, S. Kanhere, R. Jurdak","doi":"10.1109/NCA.2018.8548322","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548322","url":null,"abstract":"An increased incidence of food mislabeling and handling in recent years has led to consumers demanding transparency in how food items are produced and handled. The current traceability solutions suffer from issues such as scattering of information across multiple silos and susceptibility in recording erroneous data and thus are often unable to produce reliable farm to fork stories of products. Blockchain (BC) is a promising technology that could play an important role in providing data transparency and integrity due to its salient features which include decentralisation, immutability and auditability. In this paper, we propose a permissioned blockchain framework which is governed by a consortium of key Food Supply Chain (FSC) entities including government and regulatory bodies to promote food provenance. We propose to use a sharded, three-tiered architecture which ensures availability of data to consumers, limits access to competitive partners and provides scalability for handling transaction load. We also propose a transaction vocabulary and access rights to manage read and write privileges to BC supported by the consortium. The framework, ProductChain, ensures that trade flows are kept confidential when provenance information is retrieved by consumers and stakeholders. Simulation results show that query time for a product ledger is of the order of a few milliseconds even when the information is collated from multiple shards. ProductChain is generalised and applicable to supply chains in diverse industries.","PeriodicalId":268662,"journal":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","volume":"45 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":"132447121","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}

引用次数: 121

An Unsupervised Rule Generation Approach for Online Complex Event Processing 在线复杂事件处理的无监督规则生成方法

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) Pub Date : 2018-11-01 DOI: 10.1109/NCA.2018.8548210

Erick Petersen, Marco Antonio To, S. Maag, Thierry Yamga

{"title":"An Unsupervised Rule Generation Approach for Online Complex Event Processing","authors":"Erick Petersen, Marco Antonio To, S. Maag, Thierry Yamga","doi":"10.1109/NCA.2018.8548210","DOIUrl":"https://doi.org/10.1109/NCA.2018.8548210","url":null,"abstract":"Complex event processing (CEP) is a technique for analyzing and correlating large amount of information about events that happen in a timely manner, and being in a position to derive conclusions or even respond to them as quickly as possible. Complex events are raised based on incoming sources productions and according to a set of user-defined rules. However, as the complexity of CEP systems grow, the process for manually defining rules becomes time and resource consuming or even impossible as dynamic changes occur in the domain environment. Moreover, it restricts the use of CEP to merely the detection of straightforward situations than in more advanced fields that require earliness and prediction. Therefore, we present a novel approach for completing the supervision of an unsupervised structure learning task. More precisely, we propose to incorporate an unsupervised technique that derives labels for unlabelled data, depended on their distance. From these results, we automatically generate CEP rules to feed the system. In order to evaluate our approach, we used a real world data-set with data labeled by experts. The evaluation indicates that our approach can effectively complete the missing labels and, in some cases, improve the accuracy of the underlying CEP structure learning system.","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":"121243908","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}

引用次数: 6

Critical Phenomena in Interconnection Networks with Heterogeneous Activity 异构活动互联网络中的关键现象

2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) Pub Date : 2018-11-01 DOI: 10.1109/NCA.2018.8548347

L. Levitin, Yelena Rykalova

引用次数: 0