International Conference on Dependable Systems and Networks, 2004最新文献_第2页

High throughput Byzantine fault tolerance 高吞吐量拜占庭容错

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311928

R. Kotla, M. Dahlin

{"title":"High throughput Byzantine fault tolerance","authors":"R. Kotla, M. Dahlin","doi":"10.1109/DSN.2004.1311928","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311928","url":null,"abstract":"This paper argues for a simple change to Byzantine fault tolerant (BFT) state machine replication libraries. Traditional BFT state machine replication techniques provide high availability and security but fail to provide high throughput. This limitation stems from the fundamental assumption of generalized state machine replication techniques that all replicas execute requests sequentially in the same total order to ensure consistency across replicas. We propose a high throughput Byzantine fault tolerant architecture that uses application-specific information to identify and concurrently execute independent requests. Our architecture thus provides a general way to exploit application parallelism in order to provide high throughput without compromising correctness. Although this approach is extremely simple, it yields dramatic practical benefits. When sufficient application concurrency and hardware resources exist, CBASE, our system prototype, provides orders of magnitude improvements in throughput over BASE, a traditional BFT architecture. CBASE-FS, a Byzantine fault tolerant file system that uses CBASE, achieves twice the throughput of BASE-FS for the IOZone micro-benchmarks even in a configuration with modest available hardware parallelism.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"239 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124629431","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}

引用次数: 175

Component middleware to support non-repudiable service interactions 组件中间件支持不可抵赖的服务交互

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311931

N. Cook, P. Robinson, S. Shrivastava

引用次数: 16

A practical analysis of low-density parity-check erasure codes for wide-area storage applications 用于广域存储的低密度奇偶校验擦除码的实际分析

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311882

J. Plank, M. Thomason

引用次数: 123

Generic faultloads based on software faults for dependability benchmarking 基于软件故障的通用故障负载可靠性基准测试

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311898

J. Durães, H. Madeira

{"title":"Generic faultloads based on software faults for dependability benchmarking","authors":"J. Durães, H. Madeira","doi":"10.1109/DSN.2004.1311898","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311898","url":null,"abstract":"The most critical component of a dependability benchmark is the faultload, as it should represent a repeatable, portable, representative, and generally accepted set of faults. These properties are essential to achieve the desired standardization level required by a dependability benchmark but, unfortunately, are very hard to achieve. This is particularly true for software faults, which surely accounts for the fact that this important class of faults has never been used in known dependability benchmark proposals. This paper proposes a new methodology for the definition of faultloads based on software faults for dependability benchmarking. Faultload properties such as repeatability, portability and scalability are also analyzed and validated through experimentation using a case study of dependability benchmarking of Web-servers. We concluded that software fault-based faultloads generated using our methodology are appropriate and useful for dependability benchmarking. As our methodology is not tied to any specific software vendor or platform, it can be used to generate faultloads for the evaluation of any software product such as OLTP systems.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127469574","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}

引用次数: 33

The join problem in dynamic network algorithms 动态网络算法中的联接问题

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311901

K. Konwar, D. Kowalski, Alexander A. Shvartsman

{"title":"The join problem in dynamic network algorithms","authors":"K. Konwar, D. Kowalski, Alexander A. Shvartsman","doi":"10.1109/DSN.2004.1311901","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311901","url":null,"abstract":"Distributed algorithms in dynamic networks often employ communication patterns whose purpose is to disseminate information among the participants. Gossiping is one form of such communication pattern. In dynamic settings, the set of participants can change substantially as new participants join, and as failures and voluntary departures remove those who have joined previously. A natural question for such settings is: how soon can newly joined nodes discover each other by means of gossiping? This paper abstracts and studies the join problem for dynamic systems that use all-to-all gossip. The problem is studied in terms of join-connectivity graphs where vertices represent the participants and where each edge represents one participant's knowledge about another. Ideally, such a graph has diameter one, i.e., all participants know each other. The diameter can grow as new participants join, and as failures remove edges from the graph. Gossip helps participants discover one another, decreasing the diameter. The results describe the lower and upper bounds on the number of communication rounds such that the participants who have previously joined discover one another, under a variety of assumptions about the joining and failures. For example, in the case when new participants join at multiple participants and participants may crash, the number of rounds cannot be bounded. In the more benign cases when the failures can be controlled or when new participants join at only one participant, the bound on rounds is shown to be logarithmic in the diameter of the initial configuration.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128999332","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

Robust protection against fault-injection attacks on smart cards implementing the advanced encryption standard 对实现高级加密标准的智能卡提供针对故障注入攻击的强大保护

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311880

M. Karpovsky, Konrad J. Kulikowski, A. Taubin

引用次数: 171

Quantifying the reliability of proven SPIDER group membership service guarantees 量化已验证的SPIDER组成员服务保证的可靠性

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311897

Elizabeth Latronico, P. Miner, P. Koopman

引用次数: 16

HOURS: achieving DoS resilience in an open service hierarchy 小时:在开放的服务层次结构中实现DoS弹性

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311879

Hao Yang, Haiyun Luo, Yi Yang, Songwu Lu, Lixia Zhang

引用次数: 30

Model checking action- and state-labelled Markov chains 模型检查动作和状态标记的马尔可夫链

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311941

C. Baier, L. Cloth, B. Haverkort, M. Kuntz, M. Siegle

引用次数: 40

Model checking dependability attributes of wireless group communication 无线群通信可靠性属性的模型检验

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311942

M. Massink, J. Katoen, D. Latella

引用次数: 21