2011 IEEE 30th International Symposium on Reliable Distributed Systems最新文献_第2页

Exploiting Node Connection Regularity for DHT Replication 利用节点连接规律进行DHT复制

2011 IEEE 30th International Symposium on Reliable Distributed Systems Pub Date : 2011-10-04 DOI: 10.1109/SRDS.2011.22

Alessio Pace, Vivien Quéma, V. Schiavoni

引用次数: 20

CloudInsight: Shedding Light on the Cloud CloudInsight:在云上发光

2011 IEEE 30th International Symposium on Reliable Distributed Systems Pub Date : 2011-10-04 DOI: 10.1109/SRDS.2011.34

A. Arefin, Guofei Jiang

{"title":"CloudInsight: Shedding Light on the Cloud","authors":"A. Arefin, Guofei Jiang","doi":"10.1109/SRDS.2011.34","DOIUrl":"https://doi.org/10.1109/SRDS.2011.34","url":null,"abstract":"Cloud computing provides a revolutionary new computing paradigm for deploying enterprise applications and Internet services. Rather than operating their own data centers, today cloud users run their applications on the remote cloud infrastructures that are owned and managed by cloud providers. However, the cloud computing paradigm also introduces some new challenges in system management. Cloud users create virtual machine instances to run their specific application logic without knowing the underlying physical infrastructure. On the other side, cloud providers manage and operate their cloud infrastructures without knowing their customers' applications. Due to the decoupled ownership of applications and infrastructures, if a problem occurs, there is no visibility for either cloud users or providers to understand the whole context of the incident and solve it quickly. To this end, we propose a software solution, Cloud Insight, to provide some visibility through the middle virtualization layer for both cloud users and providers to address their problems quickly. Cloud Insight automatically tracks each VM instance's configuration status and maintains their life-cycle configuration records in a configuration management database (CMDB). When a user reports a problem, our algorithms automatically analyze CMDB to probabilistically determine the root cause and invoke a recovery process by interacting with the cloud user. Experimental results over data from Amazon EC2 online support forum and NEC Labs' research cloud infrastructures demonstrate that our approach can effectively automate the problem troubleshooting process in cloud environments.","PeriodicalId":116805,"journal":{"name":"2011 IEEE 30th International Symposium on Reliable Distributed Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130400036","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

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults 具有拜占庭错误的原子广播约简为一致

2011 IEEE 30th International Symposium on Reliable Distributed Systems Pub Date : 2011-10-04 DOI: 10.1109/SRDS.2011.36

Zarko Milosevic, Martin Hutle, A. Schiper

引用次数: 23

DONUT: Building Shortcuts in Large-Scale Decentralized Systems with Heterogeneous Peer Distributions DONUT:在异构对等分布的大规模分散系统中构建捷径

2011 IEEE 30th International Symposium on Reliable Distributed Systems Pub Date : 2011-10-04 DOI: 10.1109/SRDS.2011.20

Sergey Legtchenko, Sébastien Monnet, Pierre Sens

{"title":"DONUT: Building Shortcuts in Large-Scale Decentralized Systems with Heterogeneous Peer Distributions","authors":"Sergey Legtchenko, Sébastien Monnet, Pierre Sens","doi":"10.1109/SRDS.2011.20","DOIUrl":"https://doi.org/10.1109/SRDS.2011.20","url":null,"abstract":"Large-scale distributed systems gather thousands of peers spread all over the world. Such systems need to offer good routing performances regardless of their size and despite high churn rates. To achieve that requirement, the system must add appropriate shortcuts to its logical graph (overlay). However, to choose efficient shortcuts, peers need to obtain information about the overlay topology. In case of heterogeneous peer distributions, retrieving such information is not straightforward. Moreover, due to churn, the topology rapidly evolves, making gathered information obsolete. State of- the-art systems either avoid the problem by enforcing peers to adopt a uniform distribution or only partially fulfill these requirements. To cope with this problem, we propose DONUT, a mechanism to build a local map that approximates the peer distribution, allowing the peer to accurately estimate graph distance to other peers with a local algorithm. The evaluation performed with real latency and churn traces shows that our map increases the routing process efficiency by at least 20% compared to the state-of-the-art techniques. It points out that each map is lightweight and can be efficiently propagated through the network by consuming less than 10 bps on each peer.","PeriodicalId":116805,"journal":{"name":"2011 IEEE 30th International Symposium on Reliable Distributed Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124230630","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

Identifying Compromised Users in Shared Computing Infrastructures: A Data-Driven Bayesian Network Approach 在共享计算基础设施中识别受损用户:数据驱动的贝叶斯网络方法

2011 IEEE 30th International Symposium on Reliable Distributed Systems Pub Date : 2011-10-04 DOI: 10.1109/SRDS.2011.24

A. Pecchia, Aashis Sharma, Z. Kalbarczyk, Domenico Cotroneo, R. Iyer

{"title":"Identifying Compromised Users in Shared Computing Infrastructures: A Data-Driven Bayesian Network Approach","authors":"A. Pecchia, Aashis Sharma, Z. Kalbarczyk, Domenico Cotroneo, R. Iyer","doi":"10.1109/SRDS.2011.24","DOIUrl":"https://doi.org/10.1109/SRDS.2011.24","url":null,"abstract":"The growing demand for processing and storage capabilities has led to the deployment of high-performance computing infrastructures. Users log into the computing infrastructure remotely, by providing their credentials (e.g., username and password), through the public network and using well-established authentication protocols, e.g., SSH. However, user credentials can be stolen and an attacker (using a stolen credential) can masquerade as the legitimate user and penetrate the system as an insider. This paper deals with security incidents initiated by using stolen credentials and occurred during the last three years at the National Center for Supercomputing Applications (NCSA) at the University of Illinois. We analyze the key characteristics of the security data produced by the monitoring tools during the incidents and use a Bayesian network approach to correlate (i) data provided by different security tools (e.g., IDS and Net Flows) and (ii) information related to the users' profiles to identify compromised users, i.e., the users whose credentials have been stolen. The technique is validated with the real incident data. The experimental results demonstrate that the proposed approach is effective in detecting compromised users, while allows eliminating around 80% of false positives (i.e., not compromised user being declared compromised).","PeriodicalId":116805,"journal":{"name":"2011 IEEE 30th International Symposium on Reliable Distributed Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131677405","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}

引用次数: 29

Analyzing Performance of Lease-Based Schemes under Failures 失效情况下基于租赁的方案性能分析

2011 IEEE 30th International Symposium on Reliable Distributed Systems Pub Date : 2011-10-04 DOI: 10.1109/SRDS.2011.31

R. Vitenberg, D. Zinenko, Kristian Kvilekval, Ambuj K. Singh

引用次数: 3

Scheduling of Dynamic Participants in Real-Time Distributed Systems 实时分布式系统中动态参与者的调度

2011 IEEE 30th International Symposium on Reliable Distributed Systems Pub Date : 2011-10-04 DOI: 10.1109/SRDS.2011.37

M. Sin, Mélanie Bouroche, V. Cahill

{"title":"Scheduling of Dynamic Participants in Real-Time Distributed Systems","authors":"M. Sin, Mélanie Bouroche, V. Cahill","doi":"10.1109/SRDS.2011.37","DOIUrl":"https://doi.org/10.1109/SRDS.2011.37","url":null,"abstract":"Access to shared resources can be controlled by schedules or mutual exclusion. Such methods are not practical in an environment with dynamic participants, where nodes requiring access to shared resources can enter or leave the scene at any time. Current scheduling methods are usually centralized, demand that the system has a clear idea of when the resources are required and do not consider communication failures. Current implementations of distributed mutual exclusion use token- or permission-based methods. Dynamic participation amplifies the lost token problem in token-based approaches, while limited knowledge of the number of nodes makes obtaining quora and consensus in permission-based approaches impossible, rendering both mutual exclusion implementations impractical. This paper presents the CwoRIS protocol which enables short-term scheduling in real-time within an environment with dynamic participants. It motivates the need to support dynamic participants by means of a scenario for autonomous vehicle coordination in intersection crossing. The paper shows that the protocol is able to work in an environment with message loss and argues its correctness by showing mutual exclusion: there are no cases in which two nodes have access to the same resources at the same time.","PeriodicalId":116805,"journal":{"name":"2011 IEEE 30th International Symposium on Reliable Distributed Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122705954","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}

引用次数: 3

Exploring Latent Features for Memory-Based QoS Prediction in Cloud Computing 探索云计算中基于内存的QoS预测的潜在特征

2011 IEEE 30th International Symposium on Reliable Distributed Systems Pub Date : 2011-10-04 DOI: 10.1109/SRDS.2011.10

Yilei Zhang, Zibin Zheng, Michael R. Lyu

引用次数: 149

Candy: Component-based Availability Modeling Framework for Cloud Service Management Using SysML Candy:基于组件的可用性建模框架，用于使用SysML的云服务管理

2011 IEEE 30th International Symposium on Reliable Distributed Systems Pub Date : 2011-10-04 DOI: 10.1109/SRDS.2011.33

F. Machida, E. Andrade, Dong Seong Kim, Kishor S. Trivedi

{"title":"Candy: Component-based Availability Modeling Framework for Cloud Service Management Using SysML","authors":"F. Machida, E. Andrade, Dong Seong Kim, Kishor S. Trivedi","doi":"10.1109/SRDS.2011.33","DOIUrl":"https://doi.org/10.1109/SRDS.2011.33","url":null,"abstract":"High-availability assurance of cloud service is a critical and challenging issue for cloud service providers. To quantify the availability of cloud services from both architectural and operational points of views, availability modeling and evaluation are essential. This paper presents a component-based availability modeling framework, named Candy, which constructs a comprehensive availability model semi-automatically from system specifications described by Systems Modeling Language (SysML). SysML diagrams are translated into components of availability model and the components are assembled together to form the entire availability model in Stochastic Reward Nets (SRNs). In order to incorporate the maintenance operations of cloud services in availability models, Candy defines the translation rules from Activity diagram to SRN and synchronizes the related SRNs according to SysML allocation notations. The feasibility of the proposed modeling and availability evaluation process is studied by an illustrative example of a web application service hosted on a cloud infrastructure having multiple failure isolation zones and automatic scale-up function.","PeriodicalId":116805,"journal":{"name":"2011 IEEE 30th International Symposium on Reliable Distributed Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126829072","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}

引用次数: 69

DiveInto: Supporting Diversity in Intrusion-Tolerant Systems 深入研究:在入侵容忍系统中支持多样性

2011 IEEE 30th International Symposium on Reliable Distributed Systems Pub Date : 2011-10-04 DOI: 10.1109/SRDS.2011.25

João Antunes, N. Neves

引用次数: 10