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

Anonymous On-Demand Routing and Secure Checking of Traffic Forwarding for Mobile Ad Hoc Networks 移动Ad Hoc网络的匿名按需路由及流量转发安全检测

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

R. Jiang, Yuan Xing

引用次数: 6

Reliable On-Chip Memory Design for CMPs 可靠的cmp片上存储器设计

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

Abbas BanaiyanMofrad

引用次数: 1

AAD: Adaptive Anomaly Detection System for Cloud Computing Infrastructures 面向云计算基础设施的自适应异常检测系统

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

H. Pannu, Jianguo Liu, Song Fu

{"title":"AAD: Adaptive Anomaly Detection System for Cloud Computing Infrastructures","authors":"H. Pannu, Jianguo Liu, Song Fu","doi":"10.1109/SRDS.2012.3","DOIUrl":"https://doi.org/10.1109/SRDS.2012.3","url":null,"abstract":"Cloud computing has become increasingly popular by obviating the need for users to own and maintain complex computing infrastructure. However, due to their inherent complexity and large scale, production cloud computing systems are prone to various runtime problems caused by hardware and software failures. Autonomic failure detection is a crucial technique for understanding emergent, cloudwide phenomena and self-managing cloud resources for system-level dependability assurance. To detect failures, we need to monitor the cloud execution and collect runtime performance data. These data are usually unlabeled, and thus a prior failure history is not always available in production clouds, especially for newly managed or deployed systems. In this paper, we present an Adaptive Anomaly Detection (AAD) framework for cloud dependability assurance. It employs data description using hypersphere for adaptive failure detection. Based on the cloud performance data, AAD detects possible failures, which are verified by the cloud operators. They are confirmed as either true failures with failure types or normal states. The algorithm adapts itself by recursively learning from these newly verified detection results to refine future detections. Meanwhile, it exploits the observed but undetected failure records reported by the cloud operators to identify new types of failures. We have implemented a prototype of the algorithm and conducted experiments in an on-campus cloud computing environment. Our experimental results show that AAD can achieve more efficient and accurate failure detection than other existing scheme.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"18 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":"131403111","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}

引用次数: 50

A Theory of Packet Flows Based on Law-of-Mass-Action Scheduling 基于质量-动作调度定律的分组流理论

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

Thomas Meyer, C. Tschudin

{"title":"A Theory of Packet Flows Based on Law-of-Mass-Action Scheduling","authors":"Thomas Meyer, C. Tschudin","doi":"10.1109/SRDS.2012.2","DOIUrl":"https://doi.org/10.1109/SRDS.2012.2","url":null,"abstract":"Designing dynamically robust protocols is not a simple task with current classic work-conserving scheduling, where packets are sent out as soon as processing and transmission capacity is available. We show that deviating from this fundamental queuing assumption leads to much more controllable and analyzable forms of protocols. At the core of our work is a queue-scheduling discipline based on the chemical \"Law of Mass Action\" (LoMA) that serves a queue with a rate proportional to its fill level. In this paper we introduce our LoMA-scheduling approach and provide a solid mathematical framework adopted from chemistry that simplifies the analysis of the corresponding queueing networks, including the prediction of the underlying protocols' dynamics. We demonstrate the elegance of our model by implementing and analyzing a TCP-compatible \"chemical\" congestion control algorithm C3A with only a few interacting queues (another novelty of our approach). We also show the application of our theory to gossip protocols, explain an effective implementation of the scheduler and discuss possibilities of how to integrate mass-action scheduling into traditional networking environments.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"744 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":"122983380","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

Robust and Speculative Byzantine Randomized Consensus with Constant Time Complexity in Normal Conditions 正常条件下具有恒定时间复杂度的稳健投机拜占庭随机共识

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

Bruno Vavala, N. Neves

引用次数: 3

SPECULA: Speculative Replication of Software Transactional Memory SPECULA:软件事务性内存的推测复制

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

Sebastiano Peluso, João Fernandes, P. Romano, F. Quaglia, L. Rodrigues

引用次数: 17

Pairwise Key Generation Scheme for Cellular Mobile Communication 蜂窝式移动通信的成对密钥生成方案

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

Chetan Jaiswal, Vijay Kumar

引用次数: 1

Availability Modeling and Analysis for Data Backup and Restore Operations 数据备份和恢复操作的可用性建模与分析

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

Xiaoyan Yin, Javier Alonso, F. Machida, E. Andrade, Kishor S. Trivedi

引用次数: 15

Improving the Reliability and Availability of Vehicular Communications Using Voronoi Diagram-Based Placement of Road Side Units 利用基于Voronoi图的路边单元布置提高车辆通信的可靠性和可用性

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

Prithviraj Patil, A. Gokhale

引用次数: 3

GSFord: Towards a Reliable Geo-social Notification System GSFord:迈向可靠的地理社会通知系统

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

Kyungbaek Kim, Ye Zhao, N. Venkatasubramanian

{"title":"GSFord: Towards a Reliable Geo-social Notification System","authors":"Kyungbaek Kim, Ye Zhao, N. Venkatasubramanian","doi":"10.1109/SRDS.2012.35","DOIUrl":"https://doi.org/10.1109/SRDS.2012.35","url":null,"abstract":"The eventual goal of any notification system is to deliver appropriate messages to all relevant recipients with very high reliability in a timely manner. In particular, we focus on notification in extreme situations (e.g. disasters) where geographically correlated failures hinder the ability to reach recipients inside the corresponding failed region. In this paper, we present GSFord, a reliable geo-social notification system that is aware of (a) the geographies in which the message needs to be disseminated and (b) the social network characteristics of the intended recipient, in order to maximize/increase the coverage and reliability. GSFord builds robust geo-aware P2P overlays to provide efficient location-based message delivery and reliable storage of geo-social information of recipients. When an event occurs, GSFord is able to efficiently deliver the message to recipients who are either (a) located in the event area or (b) socially correlated to the event (e.g. relatives/friends of those who are impacted by an event). Furthermore, GSFord leverages the geo-social information to trigger a social diffusion process, which operates through out-of band channels such as phone calls and human contacts, in order to reach recipients which are isolated in the failed region. Through extensive evaluations, we show that GSFord is reliable, the social diffusion process enhanced by GSFord reaches up to 99.9% of desired recipients even under massive geographically correlated regional failures. We also show that GSFord is efficient even under skewed distribution of user populations.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"18 4 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":"130754737","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}

引用次数: 13