{"title":"An Eventual alpha Partition-Participant Detector for MANETs","authors":"Léon Lim, D. Conan","doi":"10.1109/EDCC.2012.15","DOIUrl":"https://doi.org/10.1109/EDCC.2012.15","url":null,"abstract":"With Mobile Ad hoc Networks (MANETs), communication between mobile users is possible without any infrastructure. MANETs are already a necessary part of wireless systems. Due to arbitrary node arrivals, departures, crashes and movements, network partitioning may arise resulting in a degradation of the service, but not necessarily in its interruption. In this paper, we propose a distributed system model for partition able systems. We then specify and implement a partition-participant detector that captures the live ness of a partition even if the partition is not completely stable. Its role is to detect the minimal stability condition to guarantee that eventually all the stable processes in an alpha-Set elect the same leader.","PeriodicalId":205325,"journal":{"name":"2012 Ninth European Dependable Computing Conference","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126169622","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}
{"title":"Swarm Synthesis of Convergence for Symmetric Protocols","authors":"Ali Ebnenasir, Aly Farahat","doi":"10.1109/EDCC.2012.22","DOIUrl":"https://doi.org/10.1109/EDCC.2012.22","url":null,"abstract":"This paper presents a novel non-deterministic method for algorithmic addition of convergence to non-stabilizing symmetric protocols. The proposed method exploits randomization and parallelization in order to expand the scope of the search for self-stabilizing versions of non-stabilizing protocols. Such a non-deterministic method enables an embarrassingly parallel framework that exploits the computational resources of computer clusters for automated design of self-stabilizing protocols. We have implemented our approach in a software tool and have synthesized several new self-stabilizing solutions for well-known protocols in the literature (e.g., maximal matching, graph coloring and leader election on a ring). Our case studies demonstrate that the proposed method is able to automatically generate self-stabilizing versions of non-stabilizing protocols in cases where existing automated methods fail. As a result, the proposed approach increases the likelihood of success in synthesizing the self-stabilizing versions of non-stabilizing protocols.","PeriodicalId":205325,"journal":{"name":"2012 Ninth European Dependable Computing Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129015833","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}
{"title":"Designing Robust GALS Circuits with Triple Modular Redundancy","authors":"J. Lechner","doi":"10.1109/EDCC.2012.25","DOIUrl":"https://doi.org/10.1109/EDCC.2012.25","url":null,"abstract":"In this paper we describe a new method for building fault-tolerant globally asynchronous locally synchronous (GALS) systems based on triple modular redundancy. In order to avoid a single point of failure, we present a redundant clocking scheme for providing independent clock signals to the triplicated GALS modules. Independent clocking, however, requires the use of an alternative recovery mechanism, which performs voting only at certain safe synchronization points. An implementation of an asynchronous state machine controlling this recovery process is given and thoroughly evaluated concerning its robustness against soft-errors. With the help of model checking the fault-resilience of the proposed circuit is formally verified. A case study, including a description for the design automation of GALS-based TMR systems, shows the viability of the new architecture. The resulting solution offers low area overheads and a competitive performance compared to standard TMR approaches.","PeriodicalId":205325,"journal":{"name":"2012 Ninth European Dependable Computing Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134603543","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}
Domenico Cotroneo, Anna Lanzaro, R. Natella, R. Barbosa
{"title":"Experimental Analysis of Binary-Level Software Fault Injection in Complex Software","authors":"Domenico Cotroneo, Anna Lanzaro, R. Natella, R. Barbosa","doi":"10.1109/EDCC.2012.12","DOIUrl":"https://doi.org/10.1109/EDCC.2012.12","url":null,"abstract":"The injection of software faults (i.e., bugs) by mutating the binary executable code of a program enables the experimental dependability evaluation of systems for which the source code is not available. This approach requires that programming constructs used in the source code should be identified by looking only at the binary code, since the injection is performed at this level. Unfortunately, it is a difficult task to inject faults in the binary code that correctly emulate software defects in the source code. The accuracy of binary-level software fault injection techniques is therefore a major concern for their adoption in real-world scenarios. In this work, we propose a method for assessing the accuracy of binary-level fault injection, and provide an extensive experimental evaluation of a binary-level technique, G-SWFIT, in order to assess its limitations in a real-world complex software system. We injected more than 12 thousand binary-level faults in the OS and application code of the system, and we compared them with faults injected in the source code by using the same fault types of G-SWFIT. The method was effective at highlighting the pitfalls that can occur in the implementation of G-SWFIT. Our analysis shows that G-SWFIT can achieve an improved degree of accuracy if these pitfalls are avoided.","PeriodicalId":205325,"journal":{"name":"2012 Ninth European Dependable Computing Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116151981","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}
{"title":"CADA: Collaborative Auditing for Distributed Aggregation","authors":"José Valerio, P. Felber, M. Rajman, E. Rivière","doi":"10.1109/EDCC.2012.20","DOIUrl":"https://doi.org/10.1109/EDCC.2012.20","url":null,"abstract":"The aggregation of distributions, composed of the number of occurrences of each element in a set, is an operation that lies at the heart of several large-scale distributed applications. Examples include popularity tracking, recommendation systems, trust management, or popularity measurement mechanisms. These applications typically span multiple administrative domains that do not trust each other and are sensitive to biases in the distribution aggregation: the results can only be trusted if inserted values were not altered nor forged, and if nodes collecting the insertions do not arbitrarily modify the aggregation results. In order to increase the level of trust that can be granted to applications, there must be a disincentive for servers to bias the aggregation results. In this paper we present the CADA auditing mechanisms that let aggregation servers collaboratively and periodically audit one another based on probabilistic tests over server-local state. CADA differs from the existing work on accountability in that it leverages the nature of the operation being performed by the node rather than a general and application-oblivious model of the computation. The effectiveness of CADA is conveyed by an experimental evaluation that studies its ability to detect malevolent behaviors using lightweight auditing oracles.","PeriodicalId":205325,"journal":{"name":"2012 Ninth European Dependable Computing Conference","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116727281","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}
D. Powell, J. Arlat, Hoang-Nam Chu, F. Ingrand, M. Killijian
{"title":"Testing the Input Timing Robustness of Real-Time Control Software for Autonomous Systems","authors":"D. Powell, J. Arlat, Hoang-Nam Chu, F. Ingrand, M. Killijian","doi":"10.1109/EDCC.2012.16","DOIUrl":"https://doi.org/10.1109/EDCC.2012.16","url":null,"abstract":"The functional layer of an autonomous system such as a robot is required to carry out multiple real-time control activities in parallel. These activities are launched by asynchronous calls from clients situated at higher layers, so there is a need for the functional layer to provide built-in protection to ensure that it is robust with respect to requests that are issued at instants that are incompatible with its current state and could therefore cause catastrophic system failure. This paper addresses the testing of the robustness provided by such protection mechanisms. A hybrid black-box robustness testing approach is considered by which test cases are generated by random mutation of a valid sequence of requests and test verdicts are obtained by a set of property-based robustness oracles applied to a logged trace of requests and responses. An application of the proposed framework to an experimental planetary explorer robot is described.","PeriodicalId":205325,"journal":{"name":"2012 Ninth European Dependable Computing Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134399533","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}
{"title":"A Mirrored Data Structures Approach to Diverse Partial Memory Replication","authors":"R. M. Lefever, Vikram S. Adve, W. Sanders","doi":"10.1109/EDCC.2012.18","DOIUrl":"https://doi.org/10.1109/EDCC.2012.18","url":null,"abstract":"Software memory errors are a growing threat to software dependability. In previous work, we proposed an approach for detecting memory errors, called Diverse Partial Memory Replication (DPMR), that utilized automated program diversity and memory replication. The original design aimed to maximize coverage by making the pointers stored in different memory replicas comparable. In this paper, we propose and evaluate an alternative design called Mirrored Data Structures (MDS), which sacrifices pointer comparability to gain three primary benefits. 1) MDS significantly increases DPMR's applicability by eliminating all DPMR restrictions on memory allocation, pointer arithmetic, and pointer-to-pointer casts. 2) For programs that store many pointers to memory, MDS reduces DPMR's overhead, as is demonstrated in experimental results. 3) MDS significantly reduces DPMR's memory footprint.","PeriodicalId":205325,"journal":{"name":"2012 Ninth European Dependable Computing Conference","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129268054","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}
A. Gorbenko, V. Kharchenko, Seyran Mamutov, O. Tarasyuk, A. Romanovsky
{"title":"Exploring Uncertainty of Delays as a Factor in End-to-End Cloud Response Time","authors":"A. Gorbenko, V. Kharchenko, Seyran Mamutov, O. Tarasyuk, A. Romanovsky","doi":"10.1109/EDCC.2012.10","DOIUrl":"https://doi.org/10.1109/EDCC.2012.10","url":null,"abstract":"This paper reports our experience in benchmarking a cloud-based web-service and investigates instability of its performance and the delays induced by the communication medium when measured from multiple client locations. We compare the performance of MS Azure, Go Grid and an in-house server running the same benchmark web service and analyze how the client and service implementation technologies affect its performance. The uncertainty discovered in the network delay affects the overall performance and dependability of cloud computing provisioning and requires specific resilience techniques.","PeriodicalId":205325,"journal":{"name":"2012 Ninth European Dependable Computing Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115967269","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}
{"title":"Applying Data Mining for Detecting Anomalies in Satellites","authors":"D. Azevedo, A. Ambrosio, M. Vieira","doi":"10.1109/EDCC.2012.19","DOIUrl":"https://doi.org/10.1109/EDCC.2012.19","url":null,"abstract":"Telemetry data is the only source for identifying/predicting anomalies in artificial satellites. Human specialists analyze these data in real time, but its large volume, makes this analysis extremely difficult. In this experience paper we study the hypothesis of using clustering algorithms to help operators and analysts to perform telemetry analysis. Two real cases of satellite anomalies in Brazilian space missions are considered, allowing assessing and comparing the effectiveness of two clustering algorithms (K-means and Expectation Maximization), which showed to be effective in the case study where several telemetry channels tended to deliver outlier values and, in these cases, could support the satellite operators by allowing the anticipation of anomalies. However for silent problems, where there was just a small variation in a single telemetry, the algorithms were not as efficient.","PeriodicalId":205325,"journal":{"name":"2012 Ninth European Dependable Computing Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131510777","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}
{"title":"From Byzantine Consensus to BFT State Machine Replication: A Latency-Optimal Transformation","authors":"João Sousa, A. Bessani","doi":"10.1109/EDCC.2012.32","DOIUrl":"https://doi.org/10.1109/EDCC.2012.32","url":null,"abstract":"We present a new algorithm for state machine replication that is built around a leader-driven consensus primitive. This algorithm requires only two additional communication steps between replicas and clients if the consensus leader is correct and the system is synchronous, being thus the first latency-optimal transformation from Byzantine consensus to BFT state machine replication. We also discuss how to make simple modifications to leader-driven consensus algorithms in order to make them compatible with our transformation.","PeriodicalId":205325,"journal":{"name":"2012 Ninth European Dependable Computing Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134019389","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}