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

Modeling Medium Utilization for Admission Control in Industrial Wireless Mesh Networks 工业无线网状网络中准入控制的介质利用建模

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

G. Lukas, Timo Lindhorst, E. Nett

{"title":"Modeling Medium Utilization for Admission Control in Industrial Wireless Mesh Networks","authors":"G. Lukas, Timo Lindhorst, E. Nett","doi":"10.1109/SRDS.2011.17","DOIUrl":"https://doi.org/10.1109/SRDS.2011.17","url":null,"abstract":"Wireless Mesh Networks (WMNs) are a promising technology for industrial environment communication because of their high flexibility and low cost. To fulfill the thereby arising reliability demands, admission control can be used to prevent congestion and to provide end-to-end guarantees to applications. However, this requires a very precise modeling of the medium utilization for existing and requested data flows, which is challenging due to the dynamics of such networks. In this paper we propose a medium utilization model for small-scale multi-rate WMNs considering the end-to-end throughput. The model is integrated into a feedback control loop to allow an admission control mechanism to ensure reliable end-to-end communication. Our approach increases the available performance without sacrificing reliability. A real test-bed evaluation shows that our admission control manager allows to fully utilize the network capacity while keeping packet losses under 0.5% and three-hop latency below 5.5ms. This is a significant improvement towards reliable multi-rate WMNs, leveraging their applicability in industrial applications with high throughput demands.","PeriodicalId":116805,"journal":{"name":"2011 IEEE 30th International Symposium on Reliable Distributed Systems","volume":"3 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":"129597230","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

Process Implanting: A New Active Introspection Framework for Virtualization 进程植入:一种新的虚拟化主动内省框架

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

Zhongshu Gu, Zhui Deng, Dongyan Xu, Xuxian Jiang

引用次数: 77

Automated Discovery of Credit Card Data Flow for PCI DSS Compliance 信用卡数据流的PCI DSS合规性自动发现

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

Jennia Hizver, T. Chiueh

{"title":"Automated Discovery of Credit Card Data Flow for PCI DSS Compliance","authors":"Jennia Hizver, T. Chiueh","doi":"10.1109/SRDS.2011.15","DOIUrl":"https://doi.org/10.1109/SRDS.2011.15","url":null,"abstract":"Credit cards are key instruments in personal financial transactions. Credit card payment systems used in these transactions and operated by merchants are often targeted by hackers to steal the card data. To address this threat, the payment card industry establishes a mandatory security compliance standard for businesses that process credit cards. A central pre-requisite for this compliance procedure is to identify the credit card data flow, specifically, the stages of the card transaction processing and the server nodes that touch credit card data as they travel through the organization. In practice, this pre-requisite poses a challenge to merchants. As the payment infrastructure is implemented and later maintained, it often deviates from the original documented design. Without consistent tracking and auditing of changes, such deviations in many cases remain undocumented. Therefore building the credit card data flow for a given payment card processing infrastructure is considered a daunting task that at this point requires significant manual efforts. This paper describes a tool that is designed to automate the task of identifying the credit card data flow in commercial payment systems running on virtualized servers hosted in private cloud environments. This tool leverages virtual machine introspection technology to keep track of credit card data flows across multiple machines in real time without requiring intrusive instrumentation of the hyper visor, virtual machines, middleware or application source code. Effectiveness of this tool is demonstrated through its successful discovery of the credit card data flow of several open and closed source payment applications.","PeriodicalId":116805,"journal":{"name":"2011 IEEE 30th International Symposium on Reliable Distributed Systems","volume":"29 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":"132431158","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}

引用次数: 11

Modeling the Fault Tolerance Consequences of Deduplication 重复数据删除的容错结果建模

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

Eric Rozier, W. Sanders, Pin Zhou, N. Mandagere, Sandeep Uttamchandani, Mark L. Yakushev

引用次数: 20

An Architecture for Reliable Encapsulation Endpoints Using Commodity Hardware 使用商用硬件实现可靠封装端点的体系结构

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

Robert M. Robinson, Paul A. S. Ward

引用次数: 1

Finding Almost-Invariants in Distributed Systems 寻找分布式系统中的几乎不变量

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

M. Yabandeh, A. Anand, M. Canini, Dejan Kostic

{"title":"Finding Almost-Invariants in Distributed Systems","authors":"M. Yabandeh, A. Anand, M. Canini, Dejan Kostic","doi":"10.1109/SRDS.2011.29","DOIUrl":"https://doi.org/10.1109/SRDS.2011.29","url":null,"abstract":"It is notoriously hard to develop dependable distributed systems. This is partly due to the difficulties in foreseeing various corner cases and failure scenarios while implementing a system that will be deployed over an asynchronous network. In contrast, reasoning about the desired distributed system behavior and the corresponding invariants is easier than reasoning about the code itself. Further, the invariants can be used for testing, theorem proving, and runtime enforcement. In this paper, we propose an approach to observe the system behavior and automatically infer invariants which reveal implementation bugs. Using our tool, Avenger, we automatically generate a large number of potentially relevant properties, check them within the time and spatial domains using traces of system executions, and filter out all but a few properties before reporting them to the developer. Our key insight in filtering is that a good candidate for an invariant is the one that holds in all but a few cases, i.e., an \"almost-invariant\". Our experimental results with the XORP BGP implementation demonstrate Avenger's ability to identify the almost-invariants that lead the developer to programming errors.","PeriodicalId":116805,"journal":{"name":"2011 IEEE 30th International Symposium on Reliable Distributed Systems","volume":"61 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":"121939023","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}

引用次数: 12

Balancing the Communication Load of State Transfer in Replicated Systems 平衡复制系统中状态转移的通信负荷

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

Narasimha Raghavan, R. Vitenberg

引用次数: 8

Fast Genuine Generalized Consensus 快速真广义共识

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

P. Sutra, M. Shapiro

引用次数: 31

A Scalable Cloud-based Queuing Service with Improved Consistency Levels 一个可扩展的基于云的队列服务，具有改进的一致性级别

2011 IEEE 30th International Symposium on Reliable Distributed Systems Pub Date : 2010-12-07 DOI: 10.1109/SRDS.2011.35

Han Chen, Fan Ye, Minkyong Kim, H. Lei

{"title":"A Scalable Cloud-based Queuing Service with Improved Consistency Levels","authors":"Han Chen, Fan Ye, Minkyong Kim, H. Lei","doi":"10.1109/SRDS.2011.35","DOIUrl":"https://doi.org/10.1109/SRDS.2011.35","url":null,"abstract":"Queuing is commonly used to connect loosely coupled components to form large-scale, highly-distributed, and fault-tolerant applications. As cloud computing continues to gain popularity, a number of vendors have started offering cloud-hosted, multi-tenant queuing service. They provide high availability at the cost of reduced consistency. Although they offer at-least-once delivery guarantee, that is, no message loss, they do not make any effort in maintaining FIFO order, which is an important aspect of the queuing semantics. Thus they are not adequate for some applications. This paper presents the design and implementation of a scalable cloud-based queuing service, called Blue Dove Queuing Service (BDQS). It provides improved queuing consistency -- at-least-once and best-effort in-order message delivery -- while preserving high availability and reliability. It also offers clients a flexible trade-off between duplication and message order. Comprehensive evaluation is carried out on an Infrastructure-as-a-Service cloud computing platform with up to 70 server nodes and 1000 queues. It shows that BDQS achieves excellent performance scalability. Meanwhile, it offers an order-of-magnitude improvement in out-of-order measurement compared to existing no-order systems. Results also indicate that BDQS is highly reliable and available.","PeriodicalId":116805,"journal":{"name":"2011 IEEE 30th International Symposium on Reliable Distributed Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116980977","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