2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)最新文献_第3页

MOve: Design of An Application-Malleable Overlay 移动:应用延展性覆盖层的设计

2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06) Pub Date : 2006-10-02 DOI: 10.1109/SRDS.2006.33

Sébastien Monnet, Ramsés Morales, Gabriel Antoniu, Indranil Gupta

{"title":"MOve: Design of An Application-Malleable Overlay","authors":"Sébastien Monnet, Ramsés Morales, Gabriel Antoniu, Indranil Gupta","doi":"10.1109/SRDS.2006.33","DOIUrl":"https://doi.org/10.1109/SRDS.2006.33","url":null,"abstract":"Peer-to-peer overlays allow distributed applications to work in a wide-area, scalable, and fault-tolerant manner. However, most structured and unstructured overlays present in literature today are inflexible from the application viewpoint. In other words, the application has no control over the structure of the overlay itself. This paper proposes the concept of an application-malleable overlay, and the design of the first malleable overlay which we call MOve. In MOve, the communication characteristics of the distributed application using the overlay can influence the overlay's structure itself, with the twin goals of (1) optimizing the application performance by adapting the overlay, while also (2) retaining the large scale and fault tolerance of the overlay approach. The influence could either be explicitly specified by the application or implicitly gleaned by our algorithms. Besides neighbor list membership management, MOve also contains algorithms for resource discovery, update propagation, and churn-resistance. The emergent behavior of the implicit mechanisms used in MOve manifests in the following way: when application communication is low, most overlay links keep their default configuration; however, as application communication characteristics become more evident, the overlay gracefully adapts itself to the application","PeriodicalId":164765,"journal":{"name":"2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117232493","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}

引用次数: 6

Weakly-Persistent Causal Objects in Dynamic Distributed Systems 动态分布式系统中的弱持久因果对象

2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06) Pub Date : 2006-10-02 DOI: 10.1109/SRDS.2006.47

R. Baldoni, M. Malek, A. Milani, S. Piergiovanni

{"title":"Weakly-Persistent Causal Objects in Dynamic Distributed Systems","authors":"R. Baldoni, M. Malek, A. Milani, S. Piergiovanni","doi":"10.1109/SRDS.2006.47","DOIUrl":"https://doi.org/10.1109/SRDS.2006.47","url":null,"abstract":"In the context of clients accessing a read/write shared object, persistency of a written value is a property stating that a value written into the object is always available unless overwritten by a successive write operation. This property can be easily guaranteed in a static distributed system provided that either a subset of processes implementing the object does not crash or processes can crash and then recover being able to retrieve their last state. Unfortunately the enforcing of this property in a potentially large scale and dynamic distributed system (e.g. a P2P system) is far from being trivial when considering the case in which processes implementing the object may fail or leave at any time without notifying any other process (i.e., the last state might not be retrievable). The paper introduces the notion of weak persistency that guarantees persistency of values when a system becomes quiescent (arrivals and departures subside). An implementation of a weakly-persistent object ensuring causal consistency is provided along with its correctness proof. The interest of causal consistency lies in the fact that, contrarily to atomic consistency, it can be maintained even during non-quiescent periods of the distributed system (i.e., when persistency is not guaranteed)","PeriodicalId":164765,"journal":{"name":"2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129709141","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}

引用次数: 6

PLATO: Predictive Latency-Aware Total Ordering 预测性延迟感知总排序

2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06) Pub Date : 2006-10-02 DOI: 10.1109/SRDS.2006.36

M. Balakrishnan, K. Birman, Amar Phanishayee

引用次数: 12

DRIFT: Efficient Message Ordering in Ad Hoc Networks Using Virtual Flooding 漂移:使用虚拟泛洪的Ad Hoc网络中的有效消息排序

2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06) Pub Date : 2006-10-02 DOI: 10.1109/SRDS.2006.18

Stefan Pleisch, Thomas Clouser, Mikhail Nesterenko, A. Schiper

引用次数: 2

Systematic composition and analyzability of dependable networked embedded computing systems 可靠网络化嵌入式计算系统的系统组成与可分析性

2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06) Pub Date : 2006-10-02 DOI: 10.1109/SRDS.2006.45

K. Kim

{"title":"Systematic composition and analyzability of dependable networked embedded computing systems","authors":"K. Kim","doi":"10.1109/SRDS.2006.45","DOIUrl":"https://doi.org/10.1109/SRDS.2006.45","url":null,"abstract":"In the past decade, the application field of networked embedded computing systems (NECSs) has been showing gradual acceleration in its growth. A great majority of NECSs are subject to some fault tolerance requirements. In other words, in their application environments, the fault rates of some components, e.g., communication links, batteries, some chips, etc., are not negligible. So, research interests in fault-tolerant (FT) NECSs have been showing growing trends in the past decade in good contrast to the relatively stagnant research interests in more traditional branches of FTC such as FT data servers, etc. In particular, object-/component-oriented (OO/CO) structuring techniques for RT distributed computing systems have been established in highly promising forms with convincing demonstrations although they are still very slow in spreading through industry. Such OO/CO structuring techniques not only lead to efficient design of RTC application systems with considerably reduced labor and improved maintainability but also enable design of complex systems yielding analyzable and yet tight response time bounds. On the basis of such foundation for designing RTC systems, research in FT NECS can now proceed with much improved effectiveness and confidence","PeriodicalId":164765,"journal":{"name":"2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)","volume":"377 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131724803","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}

引用次数: 1

Cryptree: A Folder Tree Structure for Cryptographic File Systems 加密树加密文件系统的文件夹树结构

2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06) Pub Date : 2006-10-02 DOI: 10.1109/SRDS.2006.15

D. Grolimund, Luzius Meisser, S. Schmid, Roger Wattenhofer

引用次数: 68

Reliably Executing Tasks in the Presence of Untrusted Entities 在不可信实体存在的情况下可靠地执行任务

2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06) Pub Date : 2006-10-02 DOI: 10.1109/SRDS.2006.40

Antonio Fernández, Luis López, Agustín Santos, Chryssis Georgiou

{"title":"Reliably Executing Tasks in the Presence of Untrusted Entities","authors":"Antonio Fernández, Luis López, Agustín Santos, Chryssis Georgiou","doi":"10.1109/SRDS.2006.40","DOIUrl":"https://doi.org/10.1109/SRDS.2006.40","url":null,"abstract":"In this work we consider a distributed system formed by a master processor and a collection of n processors (workers) that can execute tasks; worker processors are untrusted and might act maliciously. The master assigns tasks to workers to be executed. Each task returns a binary value, and we want the master to accept only correct values with high probability. Furthermore, we assume that the service provided by the workers is not free; for each task that a worker is assigned, the master is charged with a work-unit. Therefore, considering a single task assigned to several workers, our goal is to have the master computer to accept the correct value of the task with high probability, with the smallest possible amount of work (number of workers the master assigns the task). We explore two ways of bounding the number of faulty processors: (a) we consider a fixed bound f < n/2 on the maximum number of workers that may fail, and (b) a probability p < 1/2 of any processor to be faulty (all processors are faulty with probability p, independently of the rest of processors). Our work demonstrates that it is possible to obtain high probability of correct acceptance with low work. In particular, by considering both mechanisms of bounding the number of malicious workers, we first show lower bounds on the minimum amount of (expected) work required, so that any algorithm accepts the correct value with probability of success 1 - epsiv, where epsiv Lt 1 (e.g., 1/n). Then we develop and analyze two algorithms, each using a different decision strategy, and show that both algorithms obtain the same probability of success 1 - epsiv, and in doing so, they require similar upper bounds on the (expected) work. Furthermore, under certain conditions, these upper bounds are asymptotically optimal with respect to our lower bounds","PeriodicalId":164765,"journal":{"name":"2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123572791","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}

引用次数: 28

Call Availability Prediction in a Telecommunication System: A Data Driven Empirical Approach 电信系统呼叫可用性预测:数据驱动的实证方法

2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06) Pub Date : 2006-10-02 DOI: 10.1109/SRDS.2006.12

G. A. Hoffmann, M. Malek

{"title":"Call Availability Prediction in a Telecommunication System: A Data Driven Empirical Approach","authors":"G. A. Hoffmann, M. Malek","doi":"10.1109/SRDS.2006.12","DOIUrl":"https://doi.org/10.1109/SRDS.2006.12","url":null,"abstract":"Availability prediction in a telecommunication system plays a crucial role in its management, either by alerting the operator to potential failures or by proactively initiating preventive measures. In this paper, we apply linear (ARMA, multivariate, random walk) and nonlinear (Radial and Universal Basis Functions) regression techniques to recognize system failures and to predict the system's call availability up to 15 minutes in advance. Secondly we introduce a novel nonlinear modeling technique for call availability prediction. We benchmark all five techniques against each other. The applied modeling methods are data driven rather than analytical and can handle large amounts of data. We apply the modeling techniques to real data of a commercial telecommunication platform. The data used for modeling includes: a) time stamped event-based log files; and b) continuously measured system states. Results are given in terms of a) receiver operator characteristics (AUC) for classification into classes of failure and non-failure states and b) as a cost-benefit analysis. Our findings suggest: a) high degree of nonlinearity in the data; b) statistically significant improved forecasting performance and cost-benefit ratio of nonlinear modeling techniques; and finally finding that c) log file data does not contribute to improve model performance with any modeling technique","PeriodicalId":164765,"journal":{"name":"2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124018309","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}

引用次数: 48

Proactive Resilience Revisited: The Delicate Balance Between Resisting Intrusions and Remaining Available 重新审视主动恢复力:抵抗入侵和保持可用性之间的微妙平衡

2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06) Pub Date : 2006-10-02 DOI: 10.1109/SRDS.2006.37

Paulo Sousa, N. Neves, P. Veríssimo, W. Sanders

引用次数: 27

Reducing the Availability Management Overheads of Federated Content Sharing Systems 减少联邦内容共享系统的可用性管理开销

2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06) Pub Date : 2006-10-02 DOI: 10.1109/SRDS.2006.39

Christopher Peery, Thu D. Nguyen, Francisco Matias Cuenca-Acuna

{"title":"Reducing the Availability Management Overheads of Federated Content Sharing Systems","authors":"Christopher Peery, Thu D. Nguyen, Francisco Matias Cuenca-Acuna","doi":"10.1109/SRDS.2006.39","DOIUrl":"https://doi.org/10.1109/SRDS.2006.39","url":null,"abstract":"We consider the problem of ensuring high data availability in federated content sharing systems. Ideally, such a system would provide high data availability in a device transparent manner so that users are not faced with the time-consuming and error-prone task of managing data replicas across the constituent devices of the system. We propose a novel unified availability model and a decentralized replication algorithm to approximate this ideal. Our availability model addresses three different concerns: availability during connected operation (online), availability during disconnected operation (offline), and availability after permanent disconnection from the federated system (ownership). Our replication algorithm centers around the intuition that devices should selfishly use their local storage to ensure offline and ownership availability for their individual owners. Excess storage, however, is used communally to ensure high online availability for all shared content. Evaluation of an implementation shows that our algorithm rapidly reaches stable and communally desirable configurations when there is sufficient space. Consistent with the fact that devices in a federated system are owned by different users, however, as space becomes highly constrained, the system approaches a non-cooperative configuration where devices only hoard content to serve their individual owners' needs","PeriodicalId":164765,"journal":{"name":"2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133335336","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