2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)最新文献_第2页

Parameterized and Runtime-Tunable Snapshot Isolation in Distributed Transactional Key-Value Stores 分布式事务性键值存储中的参数化和运行时可调快照隔离

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.11

Hengfeng Wei, Yu Huang, Jian Lu

{"title":"Parameterized and Runtime-Tunable Snapshot Isolation in Distributed Transactional Key-Value Stores","authors":"Hengfeng Wei, Yu Huang, Jian Lu","doi":"10.1109/SRDS.2017.11","DOIUrl":"https://doi.org/10.1109/SRDS.2017.11","url":null,"abstract":"Several relaxed variants of Snapshot Isolation (SI) have been proposed for improved performance in distributed transactional key-value stores. These relaxed variants, however, provide no specification or control of the severity of the anomalies with respect to SI. They have also been designed to be used statically throughout the whole system life cycle. To overcome these drawbacks, we propose the idea of parameterized and runtime-tunable snapshot isolation. We first define a new transactional consistency model called Relaxed Version Snapshot Isolation (RVSI), which can formally and quantitatively specify the anomalies it may produce with respect to SI. To this end, we decompose SI into three \"view properties\", for each of which we introduce a parameter to quantify one of three kinds of possible anomalies: k1-BV (k1-version bounded backward view), k2-FV (k2-version bounded forward view), and k3-SV (k3-version bounded snapshot view). We then implement a prototype partitioned replicated distributed transactional key-value store called Chameleon across multiple data centers. While achieving RVSI, Chameleon allows each transaction to dynamically tune its consistency level at runtime. The experiments show that RVSI helps to reduce the transaction abort rates when applications are willing to tolerate certain anomalies. We also evaluate the individual impacts of k1-BV, k2-FV, and k3-SV on reducing the transaction abort rates in various scenarios. We find that it depends on the issue delays between clients and replicas which of k1 and k2 plays a major role in reducing transaction abort rates.","PeriodicalId":6475,"journal":{"name":"2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89189458","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

Fine-Grained Consistency Upgrades for Online Services 在线服务的细粒度一致性升级

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.9

Filipe Freitas, J. Leitao, Nuno M. Preguiça, R. Rodrigues

引用次数: 2

Correlation-Aware Stripe Organization for Efficient Writes in Erasure-Coded Storage Systems 基于关联感知的条带组织在擦除编码存储系统中的高效写

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.18

Zhirong Shen, P. Lee, J. Shu, Wenzhong Guo

引用次数: 9

Stateless Reliable Geocasting 无状态可靠的地理铸造

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.13

Jordan Adamek, Mikhail Nesterenko, J. Robinson, S. Tixeuil

引用次数: 4

A Practical Framework for Privacy-Preserving NoSQL Databases 隐私保护NoSQL数据库的实用框架

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.10

Ricardo Macedo, J. Paulo, Rogério Pontes, Bernardo Portela, Tiago Oliveira, M. Matos, R. Oliveira

{"title":"A Practical Framework for Privacy-Preserving NoSQL Databases","authors":"Ricardo Macedo, J. Paulo, Rogério Pontes, Bernardo Portela, Tiago Oliveira, M. Matos, R. Oliveira","doi":"10.1109/SRDS.2017.10","DOIUrl":"https://doi.org/10.1109/SRDS.2017.10","url":null,"abstract":"Cloud infrastructures provide database services as cost-efficient and scalable solutions for storing and processing large amounts of data. To maximize performance, these services require users to trust sensitive information to the cloud provider, which raises privacy and legal concerns. This represents a major obstacle to the adoption of the cloud computing paradigm. Recent work addressed this issue by extending databases to compute over encrypted data. However, these approaches usually support a single and strict combination of cryptographic techniques invariably making them application specific. To assess and broaden the applicability of cryptographic techniques in secure cloud storage and processing, these techniques need to be thoroughly evaluated in a modular and configurable database environment. This is even more noticeable for NoSQL data stores where data privacy is still mostly overlooked. In this paper, we present a generic NoSQL framework and a set of libraries supporting data processing cryptographic techniques that can be used with existing NoSQL engines and composed to meet the privacy and performance requirements of different applications. This is achieved through a modular and extensible design that enables data processing over multiple cryptographic techniques applied on the same database. For each technique, we provide an overview of its security model, along with an extensive set of experiments. The framework is evaluated with the YCSB benchmark, where we assess the practicality and performance tradeoffs for different combinations of cryptographic techniques. The results for a set of macro experiments show that the average overhead in NoSQL operations performance is below 15%, when comparing our system with a baseline database without privacy guarantees.","PeriodicalId":6475,"journal":{"name":"2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82829222","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

A Greedy-Based Method for Modified Condition/Decision Coverage Testing Criterion 一种基于贪婪的条件/决策覆盖测试准则修正方法

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.33

Bo-His Li, Chin-Yu Huang

引用次数: 0

Automated Fine Tuning of Probabilistic Self-Stabilizing Algorithms 概率自稳定算法的自动微调

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.22

Saba Aflaki, Matthias Volk, Borzoo Bonakdarpour, J. Katoen, A. Storjohann

{"title":"Automated Fine Tuning of Probabilistic Self-Stabilizing Algorithms","authors":"Saba Aflaki, Matthias Volk, Borzoo Bonakdarpour, J. Katoen, A. Storjohann","doi":"10.1109/SRDS.2017.22","DOIUrl":"https://doi.org/10.1109/SRDS.2017.22","url":null,"abstract":"Although randomized algorithms have widely been used in distributed computing as a means to tackle impossibility results, it is currently unclear what type of randomization leads to the best performance in such algorithms. This paper proposes three automated techniques to find the probability distribution that achieves minimum average recovery time for an input randomized distributed self-stabilizing protocol without changing the behavior of the algorithm. Our first technique is based on solving symbolic linear algebraic equations in order to identify fastest state reachability in parametric discrete-time Markov chains. The second approach applies parameter synthesis techniques from probabilistic model checking to compute the rational function describing the average recovery time and then uses dedicated solvers to find the optimal parameter valuation. The third approach computes over- and under-approximations of the result for a given parameter region and iteratively refines the regions with minimal recovery time up to the desired precision. The latter approach finds sub-optimal solutions with negligible errors, but it is significantly more scalable in orders of magnitude as compared to the other approaches.","PeriodicalId":6475,"journal":{"name":"2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83206307","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}

引用次数: 11

Automated Resource Sharing for Virtualized GPU with Self-Configuration 基于自配置的虚拟化GPU资源自动共享

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.35

Jianguo Yao, Q. Lu, Zhengwei Qi

引用次数: 3

Detecting TCP-Based DDoS Attacks in Baidu Cloud Computing Data Centers 百度云计算数据中心基于tcp的DDoS攻击检测

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.37

Jiahui Jiao, Benjun Ye, Yue Zhao, Rebecca J. Stones, G. Wang, X. Liu, Shaoyan Wang, Gu-Ya Xie

{"title":"Detecting TCP-Based DDoS Attacks in Baidu Cloud Computing Data Centers","authors":"Jiahui Jiao, Benjun Ye, Yue Zhao, Rebecca J. Stones, G. Wang, X. Liu, Shaoyan Wang, Gu-Ya Xie","doi":"10.1109/SRDS.2017.37","DOIUrl":"https://doi.org/10.1109/SRDS.2017.37","url":null,"abstract":"Cloud computing data centers have become one of the most important infrastructures in the big-data era. When considering the security of data centers, distributed denial of service (DDoS) attacks are one of the most serious problems. Here we consider DDoS attacks leveraging TCP traffic, which are increasingly rampant but are difficult to detect. To detect DDoS attacks, we identify two attack modes: fixed source IP attacks (FSIA) and random source IP attacks (RSIA), based on the source IP address used by attackers. We also propose a real-time TCP-based DDoS detection approach, which extracts effective features of TCP traffic and distinguishes malicious traffic from normal traffic by two decision tree classifiers. We evaluate the proposed approach using a simulated dataset and real datasets, including the ISCX IDS dataset, the CAIDA DDoS Attack 2007 dataset, and a Baidu Cloud Computing Platform dataset. Experimental results show that the proposed approach can achieve attack detection rate higher than 99% with a false alarm rate less than 1%. This approach will be deployed to the victim-end DDoS defense system in Baidu cloud computing data center.","PeriodicalId":6475,"journal":{"name":"2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75875644","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}

引用次数: 20

CausalSpartan: Causal Consistency for Distributed Data Stores Using Hybrid Logical Clocks CausalSpartan:使用混合逻辑时钟的分布式数据存储的因果一致性

2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS) Pub Date : 2017-09-01 DOI: 10.1109/SRDS.2017.27

Mohammad Roohitavaf, M. Demirbas, S. Kulkarni

{"title":"CausalSpartan: Causal Consistency for Distributed Data Stores Using Hybrid Logical Clocks","authors":"Mohammad Roohitavaf, M. Demirbas, S. Kulkarni","doi":"10.1109/SRDS.2017.27","DOIUrl":"https://doi.org/10.1109/SRDS.2017.27","url":null,"abstract":"Causal consistency is an intermediate consistency model that can be achieved together with high availability and high-performance requirements even in presence of network partitions. In the context of partitioned data stores, it has been shown that implicit dependency tracking using clocks is more efficient than explicit dependency tracking by sending dependency check messages. Existing clock-based solutions depend on monotonic psychical clocks that are closely synchronized. These requirements make current protocols vulnerable to clock anomalies. In this paper, we propose a new clock-based algorithm, CausalSpartan, that instead of physical clocks, utilizes Hybrid Logical Clocks (HLCs). We show that using HLCs, without any overhead, we make the system robust on physical clock anomalies. This improvement is more significant in the context of query amplification, where a single query results in multiple GET/PUT operations. We also show that CausalSpartan decreases the visibility latency for a given data item comparing to existing clock-based approaches. In turn, this reduces the completion time of collaborative applications where two clients accessing two different replicas edit same items of the data store. Like previous protocols, CausalSpartan assumes that a given client does not access more than one replica. We show that in presence of network partitions, this assumption (made in several other works) is essential if one were to provide causal consistency as well as immediate availability to local updates.","PeriodicalId":6475,"journal":{"name":"2017 IEEE 36th Symposium on Reliable Distributed Systems (SRDS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74438773","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}

引用次数: 32