2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)最新文献_第2页

Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability 测试与设置，自适应重命名和设置协议:异步可计算性的导览

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007) Pub Date : 2007-10-10 DOI: 10.1109/SRDS.2007.8

E. Gafni, M. Raynal, Corentin Travers

{"title":"Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability","authors":"E. Gafni, M. Raynal, Corentin Travers","doi":"10.1109/SRDS.2007.8","DOIUrl":"https://doi.org/10.1109/SRDS.2007.8","url":null,"abstract":"An important issue in fault-tolerant asynchronous computing is the respective power of an object type with respect to another object type. This question has received a lot of attention, mainly in the context of the consensus problem where a major advance has been the introduction of the consensus number notion that allows ranking the synchronization power of base object types (atomic registers, queues, test&set objects, compare&swap objects, etc.) with respect to the consensus problem. This has given rise to the well-known Herlihy's hierarchy. Due to its very definition, the consensus number notion is irrelevant for studying the respective power of object types that are too weak to solve consensus for an arbitrary number of processes (these objects are usually called subconsensus objects). Considering an asynchonous system made up of n processes prone to crash, this paper addresses the power of such object types, namely, the k-test&set object type, the k-set agreement object type, and the adaptive M-renaming object type for M = 2p - [P/N] and M = min(2p - 1,p + k - 1), where p < n is the number of processes that want to acquire a new name. It investigates their respective power stating the necessary and sufficient conditions to build objects of any of these types from objects of any of the other types. More precisely, the paper shows that (1) these object types define a strict hierarchy when k ne1,n - 1, (2) they all are equivalent when k = n - 1, and (3) they all are equivalent except k-set agreement that is stronger when k = 1 ne n - 1 (a side effect of these results is that that the consensus number of the renaming problem is 2.)","PeriodicalId":224921,"journal":{"name":"2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134161055","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}

引用次数: 30

Stateful Detection in High Throughput Distributed Systems 高吞吐量分布式系统中的状态检测

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007) Pub Date : 2007-10-10 DOI: 10.1109/SRDS.2007.15

G. Khanna, I. Laguna, F. Arshad, S. Bagchi

引用次数: 9

Distributed Diagnosis of Failures in a Three Tier E-Commerce System 三层电子商务系统的分布式故障诊断

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007) Pub Date : 2007-10-10 DOI: 10.1109/SRDS.2007.16

G. Khanna, I. Laguna, F. Arshad, S. Bagchi

引用次数: 26

Quantifying Temporal and Spatial Correlation of Failure Events for Proactive Management 量化故障事件的时间和空间相关性的前瞻性管理

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007) Pub Date : 2007-10-10 DOI: 10.1109/SRDS.2007.18

S. Fu, Chengzhong Xu

引用次数: 72

Hypervisor-Based Efficient Proactive Recovery 基于hypervisor的高效主动恢复

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007) Pub Date : 2007-10-10 DOI: 10.1109/SRDS.2007.25

Hans P. Reiser, R. Kapitza

引用次数: 76

Building Trust in Storage Outsourcing: Secure Accounting of Utility Storage 在存储外包中建立信任:公用事业存储的安全会计

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007) Pub Date : 2007-10-10 DOI: 10.1109/SRDS.2007.30

Vishal Kher, Yongdae Kim

{"title":"Building Trust in Storage Outsourcing: Secure Accounting of Utility Storage","authors":"Vishal Kher, Yongdae Kim","doi":"10.1109/SRDS.2007.30","DOIUrl":"https://doi.org/10.1109/SRDS.2007.30","url":null,"abstract":"We are witnessing a revival of storage service providers in the form of new vendors as well as traditional players. While storage outsourcing is cost-effective, many companies are hesitating to outsource their storage due to security concerns. The success of storage outsourcing is highly dependent on how well the providers can establish trust with their consumers. While significant work has been done to ensure confidentiality, integrity, and availability of data, a practical solution for accounting of outsourced storage is still at large missing. This paper presents Saksha, a secure accounting system that enables automated and verifiable metering of the resources utilized by the consumers. A provider that includes Saksha as a part of its storage service can prove to its customers the amount of resources utilized by them. As a result, Saksha will help to enhance trust by preventing any inflation or deflation of the service usage. Saksha is not restricted to any particular pricing model; it can be applied to the popular pay-per-use pricing model for utility storage as well as many of its variants. In addition, it can be used by the consumers to periodically evaluate their usage and reassess their outsourcing requirements. Saksha is developed such that it can be layered on the top of networked file systems. Our performance results demonstrate that Saksha is efficient and can be used in practice.","PeriodicalId":224921,"journal":{"name":"2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123513319","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}

引用次数: 13

A Gambling Approach to Scalable Resource-Aware Streaming 可扩展的资源感知流的赌博方法

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007) Pub Date : 2007-10-10 DOI: 10.1109/SRDS.2007.17

Mouna Allani, B. Garbinato, F. Pedone, M. Stamenkovic

{"title":"A Gambling Approach to Scalable Resource-Aware Streaming","authors":"Mouna Allani, B. Garbinato, F. Pedone, M. Stamenkovic","doi":"10.1109/SRDS.2007.17","DOIUrl":"https://doi.org/10.1109/SRDS.2007.17","url":null,"abstract":"In this paper, we propose a resource-aware solution to achieving reliable and scalable stream diffusion in a probabilistic model, i.e., where communication links and processes are subject to message losses and crashes, respectively. Our solution is resource-aware in the sense that it limits the memory consumption, by strictly scoping the knowledge each process has about the system, and the bandwidth available to each process, by assigning a fixed quota of messages to each process. We describe our approach as gambling in the sense that it consists in accepting to give up on a few processes sometimes, in the hope to better serve all processes most of the time. That is, our solution deliberately takes the risk not to reach some processes in some executions, in order to reach every process in most executions. The underlying stream diffusion algorithm is based on a tree-construction technique that dynamically distributes the load of forwarding stream packets among processes, based on their respective available bandwidths. Simulations show that this approach pays off when compared to traditional gossiping, when the latter faces identical bandwidth constraints.","PeriodicalId":224921,"journal":{"name":"2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129854767","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}

引用次数: 13

PEACE-VO: A Secure Policy-Enabled Collaboration Framework for Virtual Organizations PEACE-VO:虚拟组织的安全策略支持协作框架

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007) Pub Date : 2007-10-10 DOI: 10.1109/SRDS.2007.12

Jianxin Li, J. Huai, Chunming Hu

{"title":"PEACE-VO: A Secure Policy-Enabled Collaboration Framework for Virtual Organizations","authors":"Jianxin Li, J. Huai, Chunming Hu","doi":"10.1109/SRDS.2007.12","DOIUrl":"https://doi.org/10.1109/SRDS.2007.12","url":null,"abstract":"The increasing complexity and dynamics of grid environments have posed great challenges for secure and privacy-preserving collaboration in a virtual organization. In this paper, we propose PEACE-VO, a secure policy-enabled collaboration framework for virtual organizations. PEACE-VO employs role mapping to define trust relationships across autonomous domains. Nevertheless, a critical issue emerges when the system applies role mapping, which is potential policy conflict in a local domain. We first develop two concepts to depict such possible conflicts within the collaboration policy. Next, we propose a fully distributed evaluation algorithm to detect potential policy conflicts, which does not require domains to disclose their full local security policies and therefore preserves critical domain privacy. Finally, we design two dedicated protocols for virtual organization management and authorization services, respectively. We have successfully implemented the PEACE-VO framework with two fundamental protocols, i.e., VO management protocol and service authorization protocol, in the CROWN grid. Comprehensive experimental study shows our approach is scalable and efficient.","PeriodicalId":224921,"journal":{"name":"2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126214448","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

RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks 快速:无线自组织网络中的可靠概率传播

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007) Pub Date : 2007-10-10 DOI: 10.1109/SRDS.2007.9

Vadim Drabkin, R. Friedman, G. Kliot, M. Segal

{"title":"RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks","authors":"Vadim Drabkin, R. Friedman, G. Kliot, M. Segal","doi":"10.1109/SRDS.2007.9","DOIUrl":"https://doi.org/10.1109/SRDS.2007.9","url":null,"abstract":"In this paper, we propose a novel reliable probabilistic dissemination protocol, RAPID, for mobile wireless ad-hoc networks that tolerates message omissions, node crashes, and selfish behavior. The protocol employs a combination of probabilistic forwarding with deterministic corrective measures. The forwarding probability is set based on the observed number of nodes in each one-hop neighborhood, while the deterministic corrective measures include deterministic gossiping as well as timer based corrections of the probabilistic process. These aspects of the protocol are motivated by a theoretical analysis that is also presented in the paper, which explains why this unique protocol design is inherent to ad-hoc networks environments. Since the protocol only relies on local computations and probability, it is highly resilient to mobility and failures. The paper includes a detailed performance evaluation by simulation. We compare the performance and the overhead of RAPID with the performance of other probabilistic approaches. Our results show that RAPID achieves a significantly higher node coverage with a smaller overhead.","PeriodicalId":224921,"journal":{"name":"2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)","volume":"09 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123817821","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}

引用次数: 76

Characterizing Aging Phenomena of the Java Virtual Machine Java虚拟机老化现象的表征

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007) Pub Date : 2007-10-10 DOI: 10.1109/SRDS.2007.22

Domenico Cotroneo, S. Orlando, S. Russo

引用次数: 37