2012 IEEE 31st Symposium on Reliable Distributed Systems最新文献_第5页

Versatile Key Management for Secure Cloud Storage 安全云存储的通用密钥管理

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.80

Sebastian Graf, Patrick Lang, Stefan A. Hohenadel, M. Waldvogel

{"title":"Versatile Key Management for Secure Cloud Storage","authors":"Sebastian Graf, Patrick Lang, Stefan A. Hohenadel, M. Waldvogel","doi":"10.1109/SRDS.2012.80","DOIUrl":"https://doi.org/10.1109/SRDS.2012.80","url":null,"abstract":"Not only does storing data in the cloud utilize specialized infrastructures facilitating immense scalability and high availability, but it also offers a convenient way to share any information with user-defined third-parties. However, storing data on the infrastructure of commercial third party providers, demands trust and confidence. Simple approaches, like merely encrypting the data by providing encryption keys, which at most consist of a shared secret supporting rudimentary data sharing, do not support evolving sets of accessing clients to common data. Based on approaches from the area of stream-encryption, we propose an adaption for enabling scalable and flexible key management within heterogeneous environments like cloud scenarios. Representing access-rights as a graph, we distinguish between the keys used for encrypting hierarchical data and the encrypted updates on the keys enabling flexible join-/leave-operations of clients. This distinction allows us to utilize the high availability of the cloud as updating mechanism without harming confidentiality. Our graph-based key management results in an adaption of nodes related to the changed key. The updates on the keys again continuously create an overhead related to the number of these updated nodes. The proposed scalable approach utilizes cloud-based infrastructures for confidential data and key sharing in collaborative workflows supporting variable client-sets.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134026763","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

Time-Sensitive Utility-Based Routing in Duty-Cycle Wireless Sensor Networks with Unreliable Links 链路不可靠的占空比无线传感器网络中基于时间敏感效用的路由

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.75

Mingjun Xiao, Jie Wu, Liusheng Huang

引用次数: 4

Causally Coordinated Snapshot Isolation for Geographically Replicated Data 地理上复制数据的因果协调快照隔离

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.15

Vinit Padhye, A. Tripathi

{"title":"Causally Coordinated Snapshot Isolation for Geographically Replicated Data","authors":"Vinit Padhye, A. Tripathi","doi":"10.1109/SRDS.2012.15","DOIUrl":"https://doi.org/10.1109/SRDS.2012.15","url":null,"abstract":"We propose a Snapshot Isolation based transaction execution and consistency model, referred to as causally coordinated snapshot isolation, for geographically replicated data. The data replication is managed through asynchronous update propagation. Our approach provides snapshot-isolation model over multiple sites and ensures causal ordering of transactions. We present here an efficient protocol for precisely capturing the causal data dependencies of transactions and ensuring the causal ordering based on these dependencies when applying transactions' updates at remote sites. Through experimental evaluations, we demonstrate the benefit of this protocol over an alternative approach for providing causal consistency for georeplicated data. We further extend this model to support session consistency guarantees such as read-your-writes and monotonic reads. Additionally, we provide a notion of group-session where a group of users are involved in a collaborative session. We provide various group-session consistency guarantees for users collaborating in a group. We present the mechanisms for providing these session consistency guarantees and evaluate their performance.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130874571","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}

引用次数: 9

Benchmarking Dependability of MapReduce Systems MapReduce系统可靠性的基准测试

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.12

Amit Sangroya, Damián Serrano, S. Bouchenak

{"title":"Benchmarking Dependability of MapReduce Systems","authors":"Amit Sangroya, Damián Serrano, S. Bouchenak","doi":"10.1109/SRDS.2012.12","DOIUrl":"https://doi.org/10.1109/SRDS.2012.12","url":null,"abstract":"MapReduce is a popular programming model for distributed data processing. Extensive research has been conducted on the reliability of MapReduce, ranging from adaptive and on-demand fault-tolerance to new fault-tolerance models. However, realistic benchmarks are still missing to analyze and compare the effectiveness of these proposals. To date, most MapReduce fault-tolerance solutions have been evaluated using micro benchmarks in an ad-hoc and overly simplified setting, which may not be representative of real-world applications. This paper presents MRBS, a comprehensive benchmark suite for evaluating the dependability of MapReduce systems. MRBS includes five benchmarks covering several application domains and a wide range of execution scenarios such as data-intensive vs. compute-intensive applications, or batch applications vs. online interactive applications. MRBS allows to inject various types of faults at different rates. It also considers different application workloads and data loads, and produces extensive reliability, availability and performance statistics. We illustrate the use of MRBS with Hadoop clusters running on Amazon EC2, and on a private cloud.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133656582","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}

引用次数: 37

First Step toward Cloud-Based Firewalling 迈向云端防火墙的第一步

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.31

Amir R. Khakpour, A. Liu

{"title":"First Step toward Cloud-Based Firewalling","authors":"Amir R. Khakpour, A. Liu","doi":"10.1109/SRDS.2012.31","DOIUrl":"https://doi.org/10.1109/SRDS.2012.31","url":null,"abstract":"With the explosive growth of network-based services and attacks, the complexity and cost of firewall deployment and management have been increasing rapidly. Yet, each private network, no matter big or small, has to deploy and manage its own firewall, which is the critical first line of defense. To reduce the complexity and cost in deploying and managing firewalls, businesses have started to outsource the firewall service to their Internet Service Providers (ISPs), such as AT&T, which provide cloud-based firewal service. Such fire walling model saves businesses in managing, deploying, and upgrading firewalls. The current firewall service outsourcing model requires businesses fully trust their ISPs and give ISPs their firewall policies. However, businesses typically need to keep their firewall policies confidential. In this paper, we propose the first privacy preserving firewall outsourcing approach where businesses outsource their firewall services to ISPs without revealing their firewall policies to the ISPs. The basic idea is that businesses first anonymize their firewall policies and send the anonymized policies to their ISP, then the ISP performs packet filtering based on the anonymized firewall policies. For anonymizing firewall policies, we use Firewall Decision Diagrams to cope with the multi-dimensionality of policies and Bloom Filters for the anonymization purpose. This paper deals with a hard problem. By no means that we claim our scheme is perfect, however, this effort represents the first step towards privacy preserving outsourcing of firewall services. We implemented our scheme and conducted extensive experiments. Our experimental results show that our scheme is efficient in terms of both memory usage and packet lookup time. The firewall throughput of our scheme running at ISPs is comparable to that of software firewalls running at businesses themselves.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115772672","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}

引用次数: 50

Secure Cloud Browser: Model and Architecture to Support Secure WEB Navigation 安全云浏览器:支持安全WEB导航的模型和架构

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.64

Marta Palanques, R. D. Pietro, Carlos del Ojo, M. Malet, M. Marino, Toni Felguera

引用次数: 8

TailCon: Power-Minimizing Tail Percentile Control of Response Time in Server Clusters 服务器集群中响应时间的功率最小化尾百分位控制

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.72

X. Chen, Xue Liu, Shengquan Wang, X. Chang

{"title":"TailCon: Power-Minimizing Tail Percentile Control of Response Time in Server Clusters","authors":"X. Chen, Xue Liu, Shengquan Wang, X. Chang","doi":"10.1109/SRDS.2012.72","DOIUrl":"https://doi.org/10.1109/SRDS.2012.72","url":null,"abstract":"To provide satisfactory customer experience, modern server clusters like Amazon usually set Service Level Agreement (SLA) as guaranteeing a certain percentile (i.e. 99%) of the customer requests to have a response time within a threshold (i.e. 1s). One way to meet the SLA constraint is to serve the customer requests with sufficient computing capacity based on the worst case workload estimation in the server cluster. However, this may cause unnecessary power consumption in the server cluster due to over-provision of the computing capacity especially when the workload is highly dynamic. In this paper, we propose an adaptive computing capacity allocation scheme referred to as TailCon. TailCon aims at minimizing the power consumption in the server cluster while satisfying the SLA constraint by adjusting the number of active servers and the CPU frequencies of the turn on machines online. In TailCon, we analyze the distribution of the request response time dynamically and leverage the measured request response time to estimate the workload intensity in the server cluster, which is used as a continuous feedback to find the proper provision of the computing capacity online based on optimization techniques. We conduct both the emulation using the real-word HTTP traces and the experiments to evaluate the performance of TailCon. The experimental results demonstrate the effectiveness of TailCon scheme in enforcing the SLA constraint while saving the power consumption.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128301933","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}

引用次数: 9

Fast Optimization Algorithms for Designing Cellular Networks with Guard Channel 带保护信道蜂窝网络的快速优化算法

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.29

K. Hari, T. Dohi, Kishor S. Trivedi

引用次数: 0

PGV: A Storage Enforcing Remote Verification Scheme PGV:存储强制远程验证方案

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.50

M. Husain, S. Uurtamo, Steven Y. Ko, A. Rudra, R. Sridhar

{"title":"PGV: A Storage Enforcing Remote Verification Scheme","authors":"M. Husain, S. Uurtamo, Steven Y. Ko, A. Rudra, R. Sridhar","doi":"10.1109/SRDS.2012.50","DOIUrl":"https://doi.org/10.1109/SRDS.2012.50","url":null,"abstract":"This paper presents a storage enforcing remote verification scheme, PGV (Pretty Good Verification). While existing schemes are often developed to handle a malicious adversarial model, we argue that such a model is often too strong of an assumption, resulting in over-engineered, resource-intensive mechanisms. Instead, the storage enforcement property of PGV aims at removing a practical incentive for a storage server to cheat in order to save on storage space in a covert adversarial model. At its core, PGV relies on the well-known polynomial hash, we show that the polynomial hash provably possesses the storage enforcement property and is also efficient in terms of performance. In addition to the traditional application of a client verifying the storage content at a remote server, PGV can also be applied to de-duplication scenarios where the server wants to verify whether the client possesses a significant amount of information about a file (and not just a partial knowledge/fingerprint of the file) before granting access to an existing file. We theoretically prove the power of PGV by combining Kolmogorov complexity and list decoding, and experimentally show the simplicity and low overhead of PGV by comparing it with existing schemes. Altogether, PGV provides a good, practical way to perform storage enforcing remote verification.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117286990","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

Towards Reliable Communication in Intelligent Transportation Systems 迈向智能交通系统中的可靠通信

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.79

Prithviraj Patil

引用次数: 4