2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS)最新文献

MDC-Cast: A Total-Order Broadcast Protocol for Multi-Datacenter Environments MDC-Cast:多数据中心环境下的全顺序广播协议

2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2018-10-01 DOI: 10.1109/SRDS.2018.00035

Mohamad-Jaafar Nehme, Nicolas Palix, Kamal Beydoun, Vivien Quéma

引用次数: 1

Collective Attestation: for a Stronger Security in Embedded Networks 集体认证:增强嵌入式网络的安全性

2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2018-10-01 DOI: 10.1109/SRDS.2018.00039

Ahmad Ibrahim

引用次数: 4

A Scalable and Efficient Correlation Engine to Detect Multi-Step Attacks in Distributed Systems 分布式系统中多步骤攻击检测的可扩展高效关联引擎

2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2018-10-01 DOI: 10.1109/SRDS.2018.00014

David Lanoë, M. Hurfin, Eric Totel

{"title":"A Scalable and Efficient Correlation Engine to Detect Multi-Step Attacks in Distributed Systems","authors":"David Lanoë, M. Hurfin, Eric Totel","doi":"10.1109/SRDS.2018.00014","DOIUrl":"https://doi.org/10.1109/SRDS.2018.00014","url":null,"abstract":"In distributed systems and in particular in industrial SCADA environments, alert correlation systems are necessary to identify complex multi-step attacks within the huge amount of alerts and events. In this paper we describe an automata-based correlation engine developed in the context of a European project where the main stakeholder was an energy distribution company. The behavior of the engine is extended to fit new requirements. In the proposed solution, a fully automated process generates thousands of correlation rules. Despite this major scalability challenge, the designed correlation engine exhibits good performances. Expected rates of incoming low level alerts approaching several hundreds of elements per second are tolerated. Moreover, the used data structures allow to quickly handle dynamic changes of the set of correlation rules. As some attack steps are not observed, the correlation engine can be tuned to raise an alert when all the attack steps except k of them have been detected. To be able to react to an ongoing attack by taking countermeasures, alerts must also be raised as soon as a significant prefix of an attack scenario is recognized. Fulfilling these additional requirements leads to increase the memory consumption. Therefore purge mechanisms are also proposed and analyzed. An evaluation of the tool is conducted in the context of a SCADA environment.","PeriodicalId":219374,"journal":{"name":"2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130291211","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

Improving Reliability of Deduplication-Based Storage Systems with Per-File Parity 基于文件奇偶校验的重复数据删除存储系统可靠性研究

2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2018-10-01 DOI: 10.1109/SRDS.2018.00028

Suzhen Wu, Huagao Luan, Bo Mao, Hong Jiang, Gen Niu, Hui Rao, Fang Yu, Jindong Zhou

{"title":"Improving Reliability of Deduplication-Based Storage Systems with Per-File Parity","authors":"Suzhen Wu, Huagao Luan, Bo Mao, Hong Jiang, Gen Niu, Hui Rao, Fang Yu, Jindong Zhou","doi":"10.1109/SRDS.2018.00028","DOIUrl":"https://doi.org/10.1109/SRDS.2018.00028","url":null,"abstract":"The reliability issue in deduplication-based storage systems has not received adequate attention. Existing approaches introduce data redundancy after files have been deduplicated, either by replication on critical data chunks, i.e., chunks with high reference count, or RAID schemes on unique data chunks, which means that these schemes are based on individual unique data chunks rather than individual files. This can leave individual files vulnerable to losses, particularly in the presence of transient and unrecoverable data chunk errors such as latent sector errors. To address this file reliability issue, this paper proposes a Per-File Parity (short for PFP) scheme to improve the reliability of deduplication-based storage systems. PFP computes the XOR parity within parity groups of data chunks of each file after the chunking process but before the data chunks are deduplicated. Therefore, PFP can provide parity redundancy protection for all files by intra-file recovery and a higher-level protection for data chunks with high reference counts by inter-file recovery. Our reliability analysis and extensive data-driven, failure-injection based experiments conducted on a prototype implementation of PFP show that PFP significantly outperforms the existing redundancy solutions, DTR and RCR, in system reliability, tolerating multiple data chunk failures and guaranteeing file availability upon multiple data chunk failures. Moreover, a performance evaluation shows that PFP only incurs an average of 5.7% performance degradation to the deduplication-based storage system.","PeriodicalId":219374,"journal":{"name":"2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133184688","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

Impact of Man-In-The-Middle Attacks on Ethereum 中间人攻击对以太坊的影响

2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2018-10-01 DOI: 10.1109/SRDS.2018.00012

Parinya Ekparinya, V. Gramoli, Guillaume Jourjon

引用次数: 47

Practical Continuous Aggregation in Wireless Edge Environments 无线边缘环境中的实用连续聚合

2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2018-10-01 DOI: 10.1109/SRDS.2018.00015

P. Costa, J. Leitao

{"title":"Practical Continuous Aggregation in Wireless Edge Environments","authors":"P. Costa, J. Leitao","doi":"10.1109/SRDS.2018.00015","DOIUrl":"https://doi.org/10.1109/SRDS.2018.00015","url":null,"abstract":"The edge computing paradigm brings the promise of overcoming the practical scalability limitations of cloud computing, that are a result of the high volume of data produced by Internet of Things (IoT) and other large-scale applications. The principle of edge computing is to move computations beyond the data center, closer to end-user devices where data is generated and consumed. This new paradigm creates the opportunity for edge-enabled systems and applications, that have components executing directly and cooperatively on edge devices. Having systems' components, actively and directly, collaborating in the edge, requires some form of distributed monitoring as to adapt to variable operational conditions. Monitoring requires efficient ways to aggregate information collected from multiple devices. In particular, and considering some IoT applications, monitoring will happen among devices that communicate primarily via wireless channels. In this paper we study the practical performance of several distributed continuous aggregation protocols in the wireless ad hoc setting, and propose a novel protocol that is more precise and robust than competing alternative.","PeriodicalId":219374,"journal":{"name":"2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125919845","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

[Title page iii] [标题页iii]

2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2018-10-01 DOI: 10.1109/srds.2018.00002

引用次数: 0

Geographic State Machine Replication 地理状态机复制

2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2018-10-01 DOI: 10.1109/SRDS.2018.00034

Paulo R. Coelho, F. Pedone

引用次数: 9

DMap: A Fault-Tolerant and Scalable Distributed Data Structure DMap:一种容错和可扩展的分布式数据结构

2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2018-10-01 DOI: 10.1109/SRDS.2018.00026

S. Benz, F. Pedone

引用次数: 2

Mobile Cloud-of-Clouds Storage Made Efficient: A Network Coding Based Approach 高效的移动云存储:一种基于网络编码的方法

2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2018-10-01 DOI: 10.1109/SRDS.2018.00018

Jiajie Shen, Yi Li, Yangfan Zhou, Xin Wang

{"title":"Mobile Cloud-of-Clouds Storage Made Efficient: A Network Coding Based Approach","authors":"Jiajie Shen, Yi Li, Yangfan Zhou, Xin Wang","doi":"10.1109/SRDS.2018.00018","DOIUrl":"https://doi.org/10.1109/SRDS.2018.00018","url":null,"abstract":"Cloud-of-clouds storage is a viable means to ensure security and reliability of distributed data storage, where data are encrypted, encoded, and stored in multiple clouds. However, it is a great challenge to adopt such a paradigm in mobile devices (e.g., smartphone). Mobile devices are generally incapable to perform the heavy-weight operations (i.e., data encryption, encoding, and transmission) required in such a paradigm, given the limited resources in such devices. This paper focuses on addressing this challenge, i.e., improving data storage performance in mobile cloud-of-clouds storage systems. The key of our proposal is to allow the low-capability mobile devices to offload the computational and transmission overhead to the clouds. In other words, we propose a Network Coding based Cloud-of-clouds Storage (NCCS) scheme, where the clouds can encode and exchange data collaboratively. We consider two state-of-the-art cloud-of-clouds storage approaches, i.e., AONT-RS and CAONT-RS, as example cases to deploy our scheme. Accordingly, we propose their network coding-based enhancements, namely NAONT-RS and NCAONT-RS. We implement a prototype cloud-of-clouds system to verify the efficiency of our proposal. We deploy the prototype on Microsoft Azure and conduct extensive experiments with real-world traces. The experimental results show that NAONT-RS and NCAONT-RS can reduce the time of data storage process by up to 50% and improve the throughput by up to 110% compared with their original versions, i.e., AONT-RS and CAONT-RS.","PeriodicalId":219374,"journal":{"name":"2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115220245","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