37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)最新文献_第3页

Measuring Availability in Optimistic Partition-Tolerant Systems with Data Constraints 具有数据约束的乐观分区容忍系统的可用性度量

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.62

Mikael Asplund, S. Nadjm-Tehrani, S. Beyer, Pablo Galdámez

引用次数: 12

Robustness Testing of the Windows DDK Windows DDK的稳健性测试

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.85

Manuel Mendonça, N. Neves

引用次数: 41

Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently 基于xor的纠删码容错性的有效确定

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.32

J. Wylie, R. Swaminathan

{"title":"Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently","authors":"J. Wylie, R. Swaminathan","doi":"10.1109/DSN.2007.32","DOIUrl":"https://doi.org/10.1109/DSN.2007.32","url":null,"abstract":"We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss and in which every erasure is necessary and sufficient for this to be so. The MEL is the enumeration of all minimal erasures. An XOR-based erasure code has an irregular structure that may permit it to tolerate faults at and beyond its Hamming distance. The MEL completely describes the fault tolerance of an XOR-based erasure code at and beyond its Hamming distance; it is therefore a useful metric for comparing the fault tolerance of such codes. We also propose an algorithm that efficiently determines the MEL of an erasure code. This algorithm uses the structure of the erasure code to efficiently determine the MEL. We show that, in practice, the number of minimal erasures for a given code is much less than the total number of sets of erasures that lead to data loss: in our empirical results for one corpus of codes, there were over 80 times fewer minimal erasures. We use the proposed algorithm to identify the most fault tolerant XOR-based erasure code for all possible systematic erasure codes with up to seven data symbols and up to seven parity symbols.","PeriodicalId":405751,"journal":{"name":"37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132494840","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}

引用次数: 53

Workshop on Dependable and Secure Nanocomputing 可靠和安全纳米计算研讨会

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.106

J. Arlat, R. Iyer, M. Nicolaidis

引用次数: 4

Dynamic Cross-Realm Authentication for Multi-Party Service Interactions 多方服务交互的动态跨领域认证

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.36

Dacheng Zhang, Jie Xu, Xianxian Li

{"title":"Dynamic Cross-Realm Authentication for Multi-Party Service Interactions","authors":"Dacheng Zhang, Jie Xu, Xianxian Li","doi":"10.1109/DSN.2007.36","DOIUrl":"https://doi.org/10.1109/DSN.2007.36","url":null,"abstract":"Modern distributed applications are embedding an increasing degree of dynamism, from dynamic supply-chain management, enterprise federations, and virtual collaborations to dynamic service interactions across organisations. Such dynamism leads to new security challenges. Collaborating services may belong to different security realms but often have to be engaged dynamically at run time. If their security realms do not have in place a direct cross-realm authentication relationship, it is technically difficult to enable any secure collaboration between the services. A typical solution to this is to locate at run time intermediate realms that serve as an authentication-path between the two separate realms. However, the process of generating an authentication path for two distributed services can be very complex. It could involve a large number of extra operations for credential conversion and require a long chain of invocations to intermediate services. In this paper, we address this problem by presenting a new cross-realm authentication protocol for dynamic service interactions, based on the notion of multi-party business sessions. Our protocol requires neither credential conversion nor establishment of any authentication path between session members. The correctness of the protocol is analysed, and a comprehensive empirical study is performed using two production quality grid systems, Globus 4 and CROWN. The experimental results indicate that our protocol and its implementation have a sound level of scalability and impose only a limited degree of performance overhead, which is comparable with those security-related overheads in Globus 4.","PeriodicalId":405751,"journal":{"name":"37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115526789","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

Evaluating the Impact of Simultaneous Round Participation and Decentralized Decision on the Performance of Consensus 评估同时轮参与和分散决策对共识绩效的影响

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.43

Lívia M. R. Sampaio, M. Hurfin, F. Brasileiro, F. Greve

{"title":"Evaluating the Impact of Simultaneous Round Participation and Decentralized Decision on the Performance of Consensus","authors":"Lívia M. R. Sampaio, M. Hurfin, F. Brasileiro, F. Greve","doi":"10.1109/DSN.2007.43","DOIUrl":"https://doi.org/10.1109/DSN.2007.43","url":null,"abstract":"Consensus services have been recognized as fundamental building blocks for fault-tolerant distributed systems. Many different protocols to implement such a service have been proposed, however, not a lot of effort has been placed in evaluating their performance. In particular, in the context of round-based consensus protocols for asynchronous systems augmented with failure detectors, there has been some work on evaluating how the QoS of the failure detector impacts the performance of the protocols, as well as on the trade-off between having faster decentralized decision at the expenses of generating more network load. These studies, however, focus on protocols that have no mechanism to deal with an eventual bad QoS provided by the failure detector, and have a decision pattern that is either completely centralized - only one process being able to autonomously decide - or completely decentralized - all processes being able to autonomously decide. This paper reports a thorough evaluation of the performance of a consensus protocol that has two unique features. Firstly, it mitigates the problems due to bad QoS delivered by the failure detector by allowing processes to simultaneously participate in multiple rounds. Secondly, it allows its decision pattern to be configured to have different numbers of processors allowed to autonomously decide. We have measured the decision latency of the protocol to conduct the performance analysis. The results, obtained by means of simulation, highlight the advantages and limitations of the two mechanisms and allow one to understand in a comprehensive framework how the protocol's parameters should be set, such that the best performance is achieved depending on the application's requirements.","PeriodicalId":405751,"journal":{"name":"37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125813930","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}

引用次数: 5

Uniformity by Construction in the Analysis of Nondeterministic Stochastic Systems 不确定性随机系统分析中的构造均匀性

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.96

H. Hermanns, S. Johr

引用次数: 28

Failure Resilience for Device Drivers 设备驱动程序的故障恢复

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.46

J. Herder, H. Bos, Ben Gras, P. Homburg, A. Tanenbaum

引用次数: 101

Communication Predicates: A High-Level Abstraction for Coping with Transient and Dynamic Faults 通信谓词:处理瞬态和动态故障的高级抽象

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.25

Martin Hutle, A. Schiper

引用次数: 32

Enhancing DNS Resilience against Denial of Service Attacks 增强DNS抵御拒绝服务攻击的弹性

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.42

V. Pappas, D. Massey, Lixia Zhang

引用次数: 26