2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing最新文献_第3页

A Software-Implemented Fault-Tolerance Approach for Control and Display Systems in Avionics 航空电子控制与显示系统的软件容错方法

2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing Pub Date : 2014-11-18 DOI: 10.1109/PRDC.2014.11

Camille Fayollas, J. Fabre, Philippe A. Palanque, Martin Cronel, D. Navarre, Y. Déléris

{"title":"A Software-Implemented Fault-Tolerance Approach for Control and Display Systems in Avionics","authors":"Camille Fayollas, J. Fabre, Philippe A. Palanque, Martin Cronel, D. Navarre, Y. Déléris","doi":"10.1109/PRDC.2014.11","DOIUrl":"https://doi.org/10.1109/PRDC.2014.11","url":null,"abstract":"Engineering interactive systems for safety critical applications such as in avionic digital cockpits (and more generally Graphical User interfaces) is a challenge from a dependability viewpoint. The dependability of the user interface and its related hardware and software components must be consistent with the criticality of the functions to be controlled and their required DAL levels. This paper proposes a stepwise refinement approach going from systematic identification of failure modes of these systems to their detection via formally defined assertions. The last steps of the approach present how the assertions can be included into the monitoring part of self-checking interactive components and how they can be deployed on an architecture compliant with the ARINC 653 specification, ensuring temporal and spatial segregation, thus detecting errors and preventing failures due to both physical and transient software faults. We present how these contributions have been applied to the Flight Control Unit Backup interactive application which is available in A380 interactive cockpits.","PeriodicalId":187000,"journal":{"name":"2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131629069","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

Reliable Shortest Paths in Wireless Sensor Networks: Refocusing on Link Failure Scenarios from Applications 无线传感器网络中的可靠最短路径:重新关注应用中的链路故障场景

2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing Pub Date : 2014-11-18 DOI: 10.1109/PRDC.2014.37

Md. Zakirul Alam Bhuiyan, Guojun Wang

{"title":"Reliable Shortest Paths in Wireless Sensor Networks: Refocusing on Link Failure Scenarios from Applications","authors":"Md. Zakirul Alam Bhuiyan, Guojun Wang","doi":"10.1109/PRDC.2014.37","DOIUrl":"https://doi.org/10.1109/PRDC.2014.37","url":null,"abstract":"Mission-critical applications of wireless sensor networks (WSNs) require collecting all data from sensors without any loss. Existing hop-by-hop and end-to-end retransmissions still face challenges in data collection reliably over shortest-paths in WSNs due to unreliable links and resource-constraints (energy, bandwidth). Such paths easily break when operating environments are harsh and vary from time to time and from location to location. In this paper, we propose rSP, an approach to preserve reliable shortest-paths in a WSN considering those environments. We assume that link failures are stochastic and independent. We use an algorithm to calculate the steady-state unreliability and availability of links over shortest-paths in order to optimize the extra energy consumption for a shortest-path failure. We then propose an algorithm to find local routing path reliability (LRPR) from each sensor to its upstream sensors to preserve a shortest-path reliable. If some links around some locations at some point of time appear more vulnerable than other links, the best reliable link for that time is chosen. Simulation results based on empirical dataset show that rSP improves the reliability over 70% and the energy-efficiency in WSNs by 50% compared to well-known approaches.","PeriodicalId":187000,"journal":{"name":"2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116990486","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}

引用次数: 7

Responsiveness of Service Discovery in Wireless Mesh Networks 无线Mesh网络中服务发现的响应性

2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing Pub Date : 2014-11-18 DOI: 10.1109/PRDC.2014.38

Andreas Dittrich, Daniel Solis Herrera, Pablo Coto, M. Malek

{"title":"Responsiveness of Service Discovery in Wireless Mesh Networks","authors":"Andreas Dittrich, Daniel Solis Herrera, Pablo Coto, M. Malek","doi":"10.1109/PRDC.2014.38","DOIUrl":"https://doi.org/10.1109/PRDC.2014.38","url":null,"abstract":"Service Discovery (SD) is an integral part of service networks. Before a service can be used, it needs to be discovered successfully. Thus, a comprehensive service dependability analysis needs to consider the dependability of the SD process. As a time-critical operation, an important property of SD is responsiveness: the probability of successful discovery within a deadline, even in the presence of faults. This is especially true for dynamic networks with complex fault behavior such as wireless networks. We present results of a comprehensive responsiveness evaluation of decentralized SD, specifically active SD using the Zeroconf protocol. The ExCovery experiment framework has been employed in the Distributed Embedded System (DES) wireless test bed at Freie Universität Berlin. We present and discuss the experiment results and show how SD responsiveness is affected by the position and number of requesters and providers as well as the load in the network. Results clearly demonstrate that in all but the most favorable conditions, the configurations of current SD protocols struggle to achieve a high responsiveness. We further discuss results reflecting the long-term behavior of the test bed and how its varying reliability impacts SD responsiveness.","PeriodicalId":187000,"journal":{"name":"2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117048336","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

A Practical Approach for Generating Failure Data for Assessing and Comparing Failure Prediction Algorithms 一种实用的故障数据生成方法，用于评估和比较故障预测算法

2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing Pub Date : 2014-11-18 DOI: 10.1109/PRDC.2014.19

Ivano Irrera, M. Vieira

引用次数: 22

Towards Secure and Dependable Authentication and Authorization Infrastructures 迈向安全可靠的认证与授权基础设施

2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing Pub Date : 2014-11-18 DOI: 10.1109/PRDC.2014.14

D. Kreutz, A. Bessani, Eduardo Luzeiro Feitosa, Hugo Cunha

引用次数: 13

Reasoning about Group-Based Mobility in MANETs 基于群的移动网络的推理

2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing Pub Date : 2014-11-18 DOI: 10.1109/PRDC.2014.39

Xi Wu, Si Liu, Huibiao Zhu, Yongxin Zhao

{"title":"Reasoning about Group-Based Mobility in MANETs","authors":"Xi Wu, Si Liu, Huibiao Zhu, Yongxin Zhao","doi":"10.1109/PRDC.2014.39","DOIUrl":"https://doi.org/10.1109/PRDC.2014.39","url":null,"abstract":"As one of the most interesting features of mobile ad hoc networks (MANETs), mobility may significantly affect the performance of network protocols. Realistic mobility models are not only decided by individual node movements, but also depend on node coordinations, such as group mobility. In this paper, we propose a process calculus for MANETs in which the motion path of a node is determined by both group mobility models and relative mobility models based on the reference point of the group it belongs to. Due to most of MANETs protocols are evaluated by simulation, a parametric framework is introduced to describe the mobility patterns, which can be used in the network simulation. Moreover, we develop an operational semantics to enable transitions in which the nodes may change their mobility patterns as computation proceeds or delay for some time, and we also give some semantic properties of our calculus based on these semantic rules. A weak bisimulation is provided to investigate the behavioral equivalence of the networks. Finally, a real-world case study about wireless hierarchical routing protocol with group mobility (WHIRL) is given to illustrate the applicability of our calculus.","PeriodicalId":187000,"journal":{"name":"2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134531379","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

Algorithm Selection for Error Resilience in Scientific Computing 科学计算中错误恢复的算法选择

2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing Pub Date : 2014-11-18 DOI: 10.1109/PRDC.2014.20

Joseph Callenes-Sloan, H. McNamara

{"title":"Algorithm Selection for Error Resilience in Scientific Computing","authors":"Joseph Callenes-Sloan, H. McNamara","doi":"10.1109/PRDC.2014.20","DOIUrl":"https://doi.org/10.1109/PRDC.2014.20","url":null,"abstract":"With process scaling and the adoption of post-cmos technologies, reliability and power are becoming a significant concern for future computing systems, especially highly parallel systems. Previous approaches have investigated augmenting applications with additional logic to detect and correct errors efficiently. In this research, we investigate the impact of different algorithmic designs on error resilience and propose an approach for algorithm selection for a class of equations, i.e. partial differential equations (PDEs), that are at the core of many scientific computing applications, which drive HPC systems. Many different schemes have been devised for the approximation of PDE systems, each with different accuracy, stability, and performance properties. In this research, there are two primary questions that we address: (1) Does numerical stability translate to error resilience? and (2) How do we design schemes to improve error resilience? If an algorithm's error resilience is correlated with its numerical stability properties, this may allow us to design more resilient applications by leveraging well established information on numerical stability. Even with a clear translation of numerical stability to error resilience properties, the question of designing these algorithms still remains however, due to the variety of implementations, schemes, and largely input specific nature of the design. In this research, we propose one approach for automated design using machine-learning. We observe that intelligent selection of the algorithm or a given problem, improves robustness by 20%-50%, on average, over the traditional selection of algorithms, without the addition of any other detection/correction logic.","PeriodicalId":187000,"journal":{"name":"2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117123916","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}

引用次数: 1

Computing Defects per Million in Cloud Caused by Virtual Machine Failures with Replication 带复制的虚拟机故障导致的云计算百万分率缺陷

2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing Pub Date : 2014-11-18 DOI: 10.1109/PRDC.2014.29

S. Mondal, J. Muppala, F. Machida, Kishor S. Trivedi

引用次数: 6

Formalizing Google File System 正式化谷歌文件系统

2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing Pub Date : 2014-11-01 DOI: 10.1109/PRDC.2014.32

Mengdi Wang, Bo Li, Yongxin Zhao, G. Pu

引用次数: 15

Automatic Generation of Security Argument Graphs 自动生成安全参数图

2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing Pub Date : 2014-05-28 DOI: 10.1109/PRDC.2014.13

Nils Ole Tippenhauer, W. G. Temple, A. Vu, Binbin Chen, D. Nicol, Z. Kalbarczyk, W. Sanders

引用次数: 18