2012 IEEE 31st Symposium on Reliable Distributed Systems最新文献_第2页

Exploring Compile Time Caching of Explicit Queries in Programming Codes 探索编程代码中显式查询的编译时缓存

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.27

Venkata Krishna Suhas Nerella, S. Madria, T. Weigert

引用次数: 0

From Backup to Hot Standby: High Availability for HDFS 从备份到热备:HDFS的高可用性

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.33

Andrew Oriani, Islene C. Garcia

{"title":"From Backup to Hot Standby: High Availability for HDFS","authors":"Andrew Oriani, Islene C. Garcia","doi":"10.1109/SRDS.2012.33","DOIUrl":"https://doi.org/10.1109/SRDS.2012.33","url":null,"abstract":"Cluster-based distributed file systems generally have a single master to service clients and manage the namespace. Although simple and efficient, that design compromises availability, because the failure of the master takes the entire system down. Before version 2.0.0-alpha, the Hadoop Distributed File System (HDFS) -- an open-source storage, widely used by applications that operate over large datasets, such as MapReduce, and for which an uptime of 24x7 is becoming essential -- was an example of such systems. Given that scenario, this paper proposes a hot standby for the master of HDFS achieved by (i) extending the master's state replication performed by its check pointer helper, the Backup Node, and by (ii) introducing an automatic fail over mechanism. The step (i) took advantage of the message duplication technique developed by other high availability solution for HDFS named Avatar Nodes. The step (ii) employed another Hadoop software: ZooKeeper, a distributed coordination service. That approach resulted in small code changes, 1373 lines, not requiring external components to the Hadoop project. Thus, easing the maintenance and deployment of the file system. Compared to HDFS 0.21, tests showed that both in loads dominated by metadata operations or I/O operations, the reduction of data throughput is no more than 15% on average, and the time to switch the hot standby to active is less than 100 ms. Those results demonstrate the applicability of our solution to real systems. We also present related work on high availability for other file systems and HDFS, including the official solution, recently included in HDFS 2.0.0-alpha.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"50 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120925488","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}

引用次数: 31

Response Time Reliability in Cloud Environments: An Empirical Study of n-Tier Applications at High Resource Utilization 云环境下的响应时间可靠性:高资源利用率n层应用的实证研究

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.61

Qingyang Wang, Yasuhiko Kanemasa, Jack Li, D. Jayasinghe, Motoyuki Kawaba, C. Pu

{"title":"Response Time Reliability in Cloud Environments: An Empirical Study of n-Tier Applications at High Resource Utilization","authors":"Qingyang Wang, Yasuhiko Kanemasa, Jack Li, D. Jayasinghe, Motoyuki Kawaba, C. Pu","doi":"10.1109/SRDS.2012.61","DOIUrl":"https://doi.org/10.1109/SRDS.2012.61","url":null,"abstract":"When running mission-critical web-facing applications (e.g., electronic commerce) in cloud environments, predictable response time, e.g., specified as service level agreements (SLA), is a major performance reliability requirement. Through extensive measurements of n-tier application benchmarks in a cloud environment, we study three factors that significantly impact the application response time predictability: bursty workloads (typical of web-facing applications), soft resource management strategies (e.g., global thread pool or local thread pool), and bursts in system software consumption of hardware resources (e.g., Java Virtual Machine garbage collection). Using a set of profit-based performance criteria derived from typical SLAs, we show that response time reliability is brittle, with large response time variations (order of several seconds) depending on each one of those factors. For example, for the same workload and hardware platform, modest increases in workload burstiness may result in profit drops of more than 50%. Our results show that profitbased performance criteria may contribute significantly to the successful delimitation of performance unreliability boundaries and thus support effective management of clouds.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131130298","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}

引用次数: 20

Model-Driven Comparison of State-Machine-Based and Deferred-Update Replication Schemes 基于状态机和延迟更新复制方案的模型驱动比较

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.44

P. Wojciechowski, Tadeusz Kobus, Maciej Kokociński

{"title":"Model-Driven Comparison of State-Machine-Based and Deferred-Update Replication Schemes","authors":"P. Wojciechowski, Tadeusz Kobus, Maciej Kokociński","doi":"10.1109/SRDS.2012.44","DOIUrl":"https://doi.org/10.1109/SRDS.2012.44","url":null,"abstract":"In this paper, we analyze and experimentally compare state-machine-based and deferred-update (or transactional) replication, both relying on atomic broadcast. We define a model that describes the upper and lower bounds on the execution of concurrent requests by a service replicated using either scheme. The model is parametrized by the degree of parallelism in either scheme, the number of processor cores, and the type of requests. We analytically compared both schemes and a non-replicated service, considering a bcast- and request-execution-dominant workloads. To evaluate transactional replication experimentally, we developed Paxos STM---a novel fault-tolerant distributed software transactional memory with programming constructs for transaction creation, abort, and retry. For state-machine-based replication, we used JPaxos. Both systems share the same implementat ion of atomic broadcast based on the Paxos algorithm. We present the results of performance evaluation of both replication schemes, and a non-replicated (thus prone to failures) service, considering various workloads. The key result of our theoretical and experimental work is that neither system is superior in all cases. We discuss these results in the paper.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132297398","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}

引用次数: 23

Securing a Wireless Networked Control System Using Information Fusion 利用信息融合保护无线网络控制系统

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.65

Brijesh Kashyap Chejerla, S. Madria

引用次数: 3

Towards Identifying Root Causes of Faults in Service-Based Applications 识别基于服务的应用程序故障的根本原因

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.78

Christian Inzinger, W. Hummer, B. Satzger, P. Leitner, S. Dustdar

引用次数: 3

Data De-duplication and Event Processing for Security Applications on an Embedded Processor 嵌入式处理器上安全应用的数据重复删除和事件处理

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.18

H. Nagarajaiah, S. Upadhyaya, V. Gopal

{"title":"Data De-duplication and Event Processing for Security Applications on an Embedded Processor","authors":"H. Nagarajaiah, S. Upadhyaya, V. Gopal","doi":"10.1109/SRDS.2012.18","DOIUrl":"https://doi.org/10.1109/SRDS.2012.18","url":null,"abstract":"Network security schemes generally deploy sensors and other network devices which generate huge volumes of data, overwhelming the underlying decision making algorithms. An example is corporate networks employing intrusion detection systems where there is a deluge of alert data, confounding the computations involved in sensor information fusion and alert correlation. One way to obtain fast and real-time responses is to preprocess such data to manageable sizes. In this paper, we show that data de-duplication using computationally efficient fingerprinting algorithms can provide real-time results. We present an algorithm which utilizes Rabin Fingerprinting/hashing scheme for the purpose of data de-duplication. We have implemented this algorithm on Intel Atom, which is a powerful, energy efficient embedded processor. Our study is intended to show that the relatively low performing embedded processors are capable of providing the needed computational support if they were to handle security functions in the field. When compared to the algorithmic performance on a high end system, viz. Intel Core 2 Duo processor, the positive results obtained make a case for using the Atom processor in networked applications employing mobile devices.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122847870","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

S-Paxos: Offloading the Leader for High Throughput State Machine Replication S-Paxos:卸载Leader以实现高吞吐量状态机复制

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.66

M. Biely, Zarko Milosevic, Nuno Santos, A. Schiper

引用次数: 79

Improving Security of Internet Services through Continuous and Transparent User Identity Verification 通过持续和透明的用户身份验证提高互联网服务的安全性

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.38

A. Ceccarelli, A. Bondavalli, F. Brancati, Ernesto La Mattina

引用次数: 18

Security Problems of Platform-as-a-Service (PaaS) Clouds and Practical Solutions to the Problems 平台即服务(PaaS)云的安全问题及解决方案

2012 IEEE 31st Symposium on Reliable Distributed Systems Pub Date : 2012-10-08 DOI: 10.1109/SRDS.2012.84

Mehmet Tahir Sandikkaya, A. E. Harmanci

引用次数: 31