2008 Symposium on Reliable Distributed Systems最新文献_第2页

Scalable Topology Discovery and Link State Detection Using Routing Events 使用路由事件的可扩展拓扑发现和链路状态检测

2008 Symposium on Reliable Distributed Systems Pub Date : 2008-10-06 DOI: 10.1109/SRDS.2008.17

M. Srivatsa, B. J. Ko, A. Beygelzimer, V. Madduri

引用次数: 5

An Incremental File System Consistency Checker for Block-Level CDP Systems 用于块级CDP系统的增量文件系统一致性检查器

2008 Symposium on Reliable Distributed Systems Pub Date : 2008-10-06 DOI: 10.1109/SRDS.2008.20

Maohua Lu, T. Chiueh, Shibiao Lin

{"title":"An Incremental File System Consistency Checker for Block-Level CDP Systems","authors":"Maohua Lu, T. Chiueh, Shibiao Lin","doi":"10.1109/SRDS.2008.20","DOIUrl":"https://doi.org/10.1109/SRDS.2008.20","url":null,"abstract":"A block-level continuous data protection (CDP) system logs every disk block update from an application server (e.g., a file or DBMS server) to a storage system so that any disk updates within a time window are undoable, and thus is able to provide a more flexible and efficient data protection service than conventional periodic data backup systems. Unfortunately, no existing block-level CDP systems can support arbitrary point-in-time snapshots that are guaranteed to be consistent with respect to the metadata of the application server. This deficiency seriously limits the flexibility in recovery point objective (RTO) of block-level CDP systems from the standpoint of the application servers whose data they protect. This paper describes an incremental file system check mechanism (iFSCK) that is designed to address this deficiency for file servers, and exploits file system-specific knowledge to quickly fix an arbitrary point-in-time block-level snapshot so that it is consistent with respect to file system metadata. Performance measurements taken from a fully operational iFSCK prototype show that iFSCK can turn a 10 GB point-in-time block-level snapshot to be file-system consistent in less than 1 second, and takes less than 25% of the time required by the Fsck utility for vanilla ext3 under relaxed metadata consistency requirements.","PeriodicalId":397103,"journal":{"name":"2008 Symposium on Reliable Distributed Systems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116733641","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

An Empirical Study of Denial of Service Mitigation Techniques 拒绝服务缓解技术的实证研究

2008 Symposium on Reliable Distributed Systems Pub Date : 2008-10-06 DOI: 10.1109/SRDS.2008.27

Gal Badishi, A. Herzberg, I. Keidar, Oleg Romanov, Avital Yachin

引用次数: 17

Probabilistic Failure Detection for Efficient Distributed Storage Maintenance 基于概率故障检测的高效分布式存储维护

2008 Symposium on Reliable Distributed Systems Pub Date : 2008-10-06 DOI: 10.1109/SRDS.2008.28

Jing Tian, Zhi Yang, Wei Chen, Ben Y. Zhao, Yafei Dai

{"title":"Probabilistic Failure Detection for Efficient Distributed Storage Maintenance","authors":"Jing Tian, Zhi Yang, Wei Chen, Ben Y. Zhao, Yafei Dai","doi":"10.1109/SRDS.2008.28","DOIUrl":"https://doi.org/10.1109/SRDS.2008.28","url":null,"abstract":"Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must generate new replicas to replace replica lost to permanent failures, it can save significant replication costs by not replicating following transient faults. Given the unpredictability of network dynamics, however, distinguishing permanent and transient failures is extremely difficult. Traditional timeout approaches are difficult to tune and can introduce unnecessary replication. In this paper, we propose Protector, an algorithm that addresses this problem using network-wide statistical prediction. Our algorithm drastically improves prediction accuracy by making predictions across aggregate replica groups instead of single nodes. These estimates of the number of \"live replicas\" can guide efficient data replication policies. We prove that given data on node down times and the probability of permanent failures, the estimate given by our algorithm is more accurate than all alternatives. We describe two ways to obtain the failure probability function driven by models or traces. We conduct extensive simulations based both on synthetic and real traces, and show that Protector closely approximates the performance of a perfect \"oracle\" failure detector, while significantly outperforming timeout-based detectors using a wide range of parameters.","PeriodicalId":397103,"journal":{"name":"2008 Symposium on Reliable Distributed Systems","volume":"124 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114087271","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

Protecting BitTorrent: Design and Evaluation of Effective Countermeasures against DoS Attacks 保护BitTorrent: DoS攻击有效对策的设计与评估

2008 Symposium on Reliable Distributed Systems Pub Date : 2008-10-06 DOI: 10.1109/SRDS.2008.26

M. Barcellos, Daniel Bauermann, Henrique Sant'anna, Matheus B. Lehmann, R. Mansilha

引用次数: 17

Adaptive Internal Clock Synchronization 自适应内部时钟同步

2008 Symposium on Reliable Distributed Systems Pub Date : 2008-10-06 DOI: 10.1109/SRDS.2008.32

Zbigniew Jerzak, Robert Fach, C. Fetzer

引用次数: 4

Self-Stabilization in Tree-Structured Peer-to-Peer Service Discovery Systems 树结构点对点服务发现系统的自稳定性

2008 Symposium on Reliable Distributed Systems Pub Date : 2008-10-06 DOI: 10.1109/SRDS.2008.18

E. Caron, A. Datta, F. Petit, Cédric Tedeschi

{"title":"Self-Stabilization in Tree-Structured Peer-to-Peer Service Discovery Systems","authors":"E. Caron, A. Datta, F. Petit, Cédric Tedeschi","doi":"10.1109/SRDS.2008.18","DOIUrl":"https://doi.org/10.1109/SRDS.2008.18","url":null,"abstract":"The efficiency of service discovery is critical in the development of fully decentralized middleware intended to manage large scale computational grids. This demand influenced the design of many peer-to-peer based approaches. The ability to cope with the expressiveness of the service discovery was behind the design of a new kind of overlay structures that is based on tries, or prefix trees. Although these overlays are well designed, one of their weaknesses is the lack of any concrete fault tolerant mechanism, especially in dynamic platforms; the faults are handled by using preventive and costly mechanisms, eg using a high degree of replication. Moreover, those systems cannot handle any arbitrary transient failure. Self-stabilization, which is an efficient approach to designreliable solutions for dynamic systems, was recently suggested to be a good alternative to inject fault-tolerance in peer-to-peer systems. However, most of the previous research on self-stabilization in tree and/or P2P networks was designed in theoretical models, making these approaches hard to implement in practice. In this paper, we provide a self-stabilizing message passing protocol to maintain prefix trees over practical peer-to-peer networks. A complete correctness proof is provided, as well as simulation results to estimate the practical impact of our protocol.","PeriodicalId":397103,"journal":{"name":"2008 Symposium on Reliable Distributed Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130996217","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

Assuring Resilient Time Synchronization 确保弹性时间同步

2008 Symposium on Reliable Distributed Systems Pub Date : 2008-10-06 DOI: 10.1109/SRDS.2008.12

A. Bondavalli, A. Ceccarelli, Lorenzo Falai

{"title":"Assuring Resilient Time Synchronization","authors":"A. Bondavalli, A. Ceccarelli, Lorenzo Falai","doi":"10.1109/SRDS.2008.12","DOIUrl":"https://doi.org/10.1109/SRDS.2008.12","url":null,"abstract":"In many distributed and pervasive systems the clocks of nodes are required to be synchronized to a unique global time. Due to unpredictable system and environment characteristics, the distance of a local clock from global time is a variable factor very hard to predict. Systems usually adopt measures to guarantee an upper bound on such distance from global time that are very often quite far from typical execution scenarios and thus are of practical little use. As a consequence, while in many circumstances reliable information on the actual distance from global time would improve system behaviour, unfortunately such information is usually not available. In this paper we propose the Reliable and Self-Aware Clock (R&SAClock), a low-intrusive software service that is able to compute a conservative estimation of distance from an external global time. R&SAClock acts as a new clock that couples information gained from synchronization mechanisms with information collected from the local clock to provide both current time and a self-adaptive reliable estimation of distance from global time. This paper describes the R&SAClock as a system component: we define its main functions, services and time-related mechanisms. Finally details of an implementation of the R&SAClock for the NTP synchronization mechanism and Linux OS are shown.","PeriodicalId":397103,"journal":{"name":"2008 Symposium on Reliable Distributed Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133119154","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}

引用次数: 25

ALPS: Authenticating Live Peer-to-Peer Live Streams ALPS:对点对点直播流进行认证

2008 Symposium on Reliable Distributed Systems Pub Date : 2008-10-06 DOI: 10.1109/SRDS.2008.33

R. Meier, Roger Wattenhofer

引用次数: 9

POSH: Proactive co-Operative Self-Healing in Unattended Wireless Sensor Networks POSH:无人值守无线传感器网络中的主动合作自我修复

2008 Symposium on Reliable Distributed Systems Pub Date : 2008-10-06 DOI: 10.1109/SRDS.2008.23

R. D. Pietro, Di Ma, Claudio Soriente, G. Tsudik

引用次数: 72