2014 IEEE 33rd International Symposium on Reliable Distributed Systems最新文献

A Study on Efficient Event Monitoring in Dense Mobile Wireless Sensor Networks 密集移动无线传感器网络中高效事件监测的研究

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.65

K. Matsuo, Keisuke Goto, A. Kanzaki, T. Hara, S. Nishio

引用次数: 1

Adaptive Redundant Data Allocation Using Unused Blocks for Improving Access Efficiency in Dependable Storage Systems 利用未使用的数据块自适应冗余分配，提高可靠存储系统的访问效率

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.68

Ta Hong Viet

引用次数: 0

Improving the Throughput of Wireless LAN by Tuning Carrier Sense Threshold of Access Points Based on Node Positions Detected by a Visible Light Tag System 基于可见光标签系统检测节点位置调整接入点载波感知阈值提高无线局域网吞吐量

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.60

Kodai Murakami, Tatsuya Ito, S. Ishihara

{"title":"Improving the Throughput of Wireless LAN by Tuning Carrier Sense Threshold of Access Points Based on Node Positions Detected by a Visible Light Tag System","authors":"Kodai Murakami, Tatsuya Ito, S. Ishihara","doi":"10.1109/SRDS.2014.60","DOIUrl":"https://doi.org/10.1109/SRDS.2014.60","url":null,"abstract":"The IEEE 802.11 Distributed Coordination Function (DCF) is based on the Carrier Sense Multiple Access (CSMA) algorithm for avoiding collisions of frames. In CSMA, spatial reuse can be improved by suitably changing the carrier sense threshold (CST). If the increased CST does not incur collisions and helps concurrent transmissions from multiple devices, this improves the throughput of the wireless LAN. For example, when there are two APs and multiple devices exist near each of them, each AP can transmit a frame simultaneously without causing collisions of frames since each device can receive a frame from its associated AP with a high signal power and the interference from another AP is small. In this paper, we propose a system which improves the throughput in CSMA/CA based wireless LANs by controlling the CST values of APs according to positions of mobile hosts. In the system, the CST values of multiple APs are dynamically configured by a controller which has a camera for obtaining the current positions of mobile hosts. The proposed system improves the throughput in WLAN 58% in comparison with basic DCF in a LAN where two APs are arranged at an interval of 50 m and two devices exist within 10 m from each AP.","PeriodicalId":440331,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130355347","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}

引用次数: 2

Practical Encoded Processing 实用编码处理

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.62

Dmitrii Kuvaiskii, C. Fetzer

引用次数: 0

Chained Signatures for Secure Program Execution 用于安全程序执行的链式签名

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.59

Sergei Arnautov, C. Fetzer

引用次数: 0

PCTopk: Privacy-and Correctness-Preserving Functional Top-k Query on Un-trusted Data Storage in Two-Tiered Sensor Networks 两层传感器网络中不可信数据存储的保隐私和保正确功能Top-k查询

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.27

Yao-Tung Tsou, Yung-Li Hu, Yennun Huang, S. Kuo

引用次数: 5

A Systematic Differential Analysis for Fast and Robust Detection of Software Aging 一种快速鲁棒检测软件老化的系统差分分析

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.38

Rivalino Matias, A. Andrzejak, F. Machida, Diego Elias, Kishor S. Trivedi

{"title":"A Systematic Differential Analysis for Fast and Robust Detection of Software Aging","authors":"Rivalino Matias, A. Andrzejak, F. Machida, Diego Elias, Kishor S. Trivedi","doi":"10.1109/SRDS.2014.38","DOIUrl":"https://doi.org/10.1109/SRDS.2014.38","url":null,"abstract":"Software systems running continuously for a long time often confront software aging, which is the phenomenon of progressive degradation of execution environment caused by latent software faults. Removal of such faults in software development process is a crucial issue for system reliability. A known major obstacle is typically the large latency to discover the existence of software aging. We propose a systematic approach to detect software aging which has in a shorter test time and higher accuracy compared to traditional aging detection via stress testing and trend detection with high confidence. The approach is based on a comparative differential analysis where a software version under test is compared with against a previous robust version by observing in terms of behavioral (signal) changes during system tests of resource metrics. A key instrument adopted is a divergence chart, which expresses time-dependent differences between two signals, allowing us to detect changes in the system metrics' values which indicate the existence of software aging. In our experimental study, we focuses on memory-leak detection and the and evaluates divergence charts are computed using various multiple statistical techniques combined paired with different application-level memory related metrics (RSS and Heap Usage). The experimental results show that the statistical process control techniques used in our approach proposed method achieves good performance for memory-leak detection, when compared with other in comparison to techniques widely adopted in previous works (e.g., linear regression, moving average and median).","PeriodicalId":440331,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128325340","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}

引用次数: 27

Transaction Management Using Causal Snapshot Isolation in Partially Replicated Databases 在部分复制数据库中使用因果快照隔离的事务管理

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.30

Vinit Padhye, Gowtham Rajappan, A. Tripathi

引用次数: 8

pH1: A Transactional Middleware for NoSQL pH1: NoSQL的事务性中间件

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.23

Fábio Coelho, F. Cruz, R. Vilaça, J. Pereira, R. Oliveira

{"title":"pH1: A Transactional Middleware for NoSQL","authors":"Fábio Coelho, F. Cruz, R. Vilaça, J. Pereira, R. Oliveira","doi":"10.1109/SRDS.2014.23","DOIUrl":"https://doi.org/10.1109/SRDS.2014.23","url":null,"abstract":"NoSQL databases opt not to offer important abstractions traditionally found in relational databases in order to achieve high levels of scalability and availability: transactional guarantees and strong data consistency. In this work we propose pH1, a generic middleware layer over NoSQL databases that offers transactional guarantees with Snapshot Isolation. This is achieved in a non-intrusive manner, requiring no modifications to servers and no native support for multiple versions. Instead, the transactional context is achieved by means of a multiversion distributed cache and an external transaction certifier, exposed by extending the client's interface with transaction bracketing primitives. We validate and evaluate pH1 with Apache Cassandra and Hyperdex. First, using the YCSB benchmark, we show that the cost of providing ACID guarantees to these NoSQL databases amounts to 11% decrease in throughput. Moreover, using the transaction intensive TPC-C workload, pH1 presented an impact of 22% decrease in throughput. This contrasts with OMID, a previous proposal that takes advantage of HBase's support for multiple versions, with a throughput penalty of 76% in the same conditions.","PeriodicalId":440331,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133101833","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

Make the Leader Work: Executive Deferred Update Replication 使Leader工作:执行延迟更新复制

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.42

Maciej Kokociński, Tadeusz Kobus, P. Wojciechowski

引用次数: 7