发布求助
文献互助 智能选刊 最新文献

2008 14th IEEE Pacific Rim International Symposium on Dependable Computing最新文献

筛选
英文 中文
Availability Modeling of SIP Protocol on IBM© WebSphere© IBM©WebSphere©上SIP协议的可用性建模
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.50
Kishor S. Trivedi, Dazhi Wang, D. J. Hunt, A. Rindos, W. E. Smith, B. Vashaw
{"title":"Availability Modeling of SIP Protocol on IBM© WebSphere©","authors":"Kishor S. Trivedi, Dazhi Wang, D. J. Hunt, A. Rindos, W. E. Smith, B. Vashaw","doi":"10.1109/PRDC.2008.50","DOIUrl":"https://doi.org/10.1109/PRDC.2008.50","url":null,"abstract":"We present the availability model of a high availability SIP Application Server configuration on WebSphere. Hardware,operating system and application server failures are considered. Different types of fault detectors, detection delays,failover delays, restarts, reboots and repairs are considered.Imperfect coverages for detection, failover and recovery are incorporated. Computations are based on a set of interacting sub-models of all system components capturing their failure and recovery behavior. The parameter values used in the calculations are based on several sources,including field data, high availability testing, and agreed upon assumptions. In cases where a parameter value is uncertain,due to assumptions or limited test data, a sensitivity analysis of that parameter has been provided. Our analysis indicates the failure types and recovery parameters that are most critical in their impact on overall system availability. These results will help guide system improvement efforts throughout future releases of these products.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134643593","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}
引用次数: 43
Orderly Random Testing for Both Hardware and Software 硬件和软件的有序随机测试
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.7
Shiyi Xu
{"title":"Orderly Random Testing for Both Hardware and Software","authors":"Shiyi Xu","doi":"10.1109/PRDC.2008.7","DOIUrl":"https://doi.org/10.1109/PRDC.2008.7","url":null,"abstract":"Based on random testing, this paper introduces a new concept of orderly random testing for both hardware and software systems. Random testing, having been employed for years, seems to be inefficient for its random selection of test patterns. Therefore, a new concept of pre-determined distance among test vectors is proposed in the paper to make it more effective in testing. The idea is based on the fact that the larger the distance between two adjacent test vectors in a test sequence, the more the faults will be detected by the test vectors. Procedure of constructing such a testing sequence is presented in detail. The new approach has shown its remarkable advantage of fitting in with both hardware and software testing. Experimental results and mathematical analysis are also given to evaluate the performances of the novel method.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133858913","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}
引用次数: 17
Indirect Control Path Analysis and Goal Coverage Strategies for Elaborating System Safety Goals in Composite Systems 复合系统安全目标制定的间接控制路径分析与目标覆盖策略
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.29
Jennifer Black, P. Koopman
{"title":"Indirect Control Path Analysis and Goal Coverage Strategies for Elaborating System Safety Goals in Composite Systems","authors":"Jennifer Black, P. Koopman","doi":"10.1109/PRDC.2008.29","DOIUrl":"https://doi.org/10.1109/PRDC.2008.29","url":null,"abstract":"Correctly specifying requirements for composite systems is essential to system safety, particularly in a distributed development environment. Goal-oriented requirements engineering can be used to formally specify system goals and decompose them into realizable subgoals for system components. However, an additional aim of safety goal elaboration is to meet a goal coverage strategy. In this paper we propose new tactics for elaborating system safety goals across a composite system. First, indirect control path analysis (ICPA) is used to identify safety-related components and their relationships to the parent goals. Then, goal coverage strategies guide goal elaboration along indirect control paths identified by the ICPA. We demonstrate applicability in real safety critical embedded systems with two case studies: a distributed elevator and a semiautonomous automotive system.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133982673","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
On-line Monitoring of Real Time Applications for Early Error Detection 在线监测实时应用的早期错误检测
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.31
T. Robert, J. Fabre, Matthieu Roy
{"title":"On-line Monitoring of Real Time Applications for Early Error Detection","authors":"T. Robert, J. Fabre, Matthieu Roy","doi":"10.1109/PRDC.2008.31","DOIUrl":"https://doi.org/10.1109/PRDC.2008.31","url":null,"abstract":"Error confinement technologies have proven their efficiency to improve software dependability. Such mechanisms usually require efficient error detectors to swiftly signal any misbehaviour. Real-time systems, due to their timing constraints, require a richer description of correct and/or erroneous states that includes timing aspects. This paper presents real-time error detectors that can be automatically generated from formal models of the expected behaviours of software applications. The considered specifications provide the means to define quantitative temporal constraints on the execution of the application. These detectors check at run-time that the current execution matches its specification. The paper contribution is twofold. Firstly, at the theoretical level, we provide a formal definition of the expected behaviour of such detectors, ensuring a predictable behaviour of the detector system. Secondly, at a practical level, we provide a description of the complete generation process, from the models to the code of the detector.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115990844","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
Detecting Inconsistent Values Caused by Interaction Faults Using Automatically Located Implicit Redundancies 利用自动定位隐式冗余检测交互故障导致的不一致值
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.14
B. Nassu, T. Nanya, Hiroshi Nakamura
{"title":"Detecting Inconsistent Values Caused by Interaction Faults Using Automatically Located Implicit Redundancies","authors":"B. Nassu, T. Nanya, Hiroshi Nakamura","doi":"10.1109/PRDC.2008.14","DOIUrl":"https://doi.org/10.1109/PRDC.2008.14","url":null,"abstract":"This paper addresses the problem of detecting inconsistent values caused by interaction faults originated from an external system.This type of error occurs when a correctly formatted message that is not corrupted during transmission is generated with a field that contains incorrect data.When traditional schemes cannot be used, one alternative is resorting to receiver-based strategies that employ implicit redundancies - relations between events or data, often identified by a human expert.We propose an approach for detecting inconsistent values using implicit redundancies which are automatically located in examples of communications.We show that, even without adding any redundant information to the communication, the proposed approach can achieve a reasonable error detection coverage in fields where sequential relations exist.Other aspects, such as false alarms and latency, are also evaluated.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122045010","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}
引用次数: 0
Dependable Overlay Networks 可靠的覆盖网络
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.46
H. Beitollahi, Geert Deconinck
{"title":"Dependable Overlay Networks","authors":"H. Beitollahi, Geert Deconinck","doi":"10.1109/PRDC.2008.46","DOIUrl":"https://doi.org/10.1109/PRDC.2008.46","url":null,"abstract":"Today, peer-to-peer (P2P) systems are used as a promising platform to deploy new applications and services in the internet. There are much interest in emerging P2P overlay network because they provide a good substrate for creating large scale data sharing, content distribution and application-level multicast applications. Overlay networks also have following advantages: redundant storage, efficient query search, anonymity, fault-tolerance, trust and authentication.This paper compares and analyzes various types of P2P overlay networks from dependability view. Main topics of comparison and analysis are scalability, reliability, security, availability, integrity and anonymity. We verify dependability analysis of P2P overlay networks by simulation. Both analysis and simulation results show that the purely structured decentralized type (e.g.Chord) is the most dependable P2P overlay network.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133249804","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}
引用次数: 6
Assessing and Comparing Security of Web Servers Web服务器的安全性评估与比较
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-01 DOI: 10.1109/PRDC.2008.45
N. Mendes, Afonso Araújo Neto, J. Durães, M. Vieira, H. Madeira
{"title":"Assessing and Comparing Security of Web Servers","authors":"N. Mendes, Afonso Araújo Neto, J. Durães, M. Vieira, H. Madeira","doi":"10.1109/PRDC.2008.45","DOIUrl":"https://doi.org/10.1109/PRDC.2008.45","url":null,"abstract":"This paper presents an approach to assess security of Web servers. This method can be used to compare the security features of different Web servers installations and to determine how secure a given Web server configuration is. The assessment is done by applying a set of tests designed to check if the system under evaluation fulfils a set of security practices defined by an extensive field study. This work targets the most typical issues related to Web servers ranging from classic Web servers misconfiguration to the absence of a secure network infrastructure and of well-defined security policies to respond to security incidents. The effectiveness and usefulness of the proposed approach is illustrated through the security assessment and comparison of five different real Web servers.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132518940","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}
引用次数: 33
Constructing Liberation Codes Using Latin Squares 用拉丁平方构造解放码
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-01 DOI: 10.1109/PRDC.2008.33
Wang Gang, L. Xiaoguang, Lin Sheng, Xie Guangjun, Liu Jing
{"title":"Constructing Liberation Codes Using Latin Squares","authors":"Wang Gang, L. Xiaoguang, Lin Sheng, Xie Guangjun, Liu Jing","doi":"10.1109/PRDC.2008.33","DOIUrl":"https://doi.org/10.1109/PRDC.2008.33","url":null,"abstract":"In recent years, multi-erasure correcting coding systems have become more pervasive. RAID6 is an important 2-erasure correcting code specification. But there is no consensus on the best concrete RAID6 coding scheme. Plank developed a brand new class of RAID6 codes called the Liberation codes that achieves good encoding, updating and decoding performance. In this paper, we present a chained decoding algorithm for the Liberation codes. Its performance is comparable with the bit matrix scheduling algorithm developed by Plank, but is more intuitive and reveals the essence better. In the process, we present a new class of Liberation codes called the Latin Liberation codes. These codes are based on column-hamiltonian Latin squares, hence the name. They are superior to the Liberation codes in parameter flexibility and structure flexibility. Finally, we analyze the performance of several XOR-based RAID6 codes and give some suggestion on their application.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"31 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132940147","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 Functional Unit with Small Variety of Highly Reliable Cells 一个具有少量高可靠性细胞的功能单元
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-03-28 DOI: 10.1109/PRDC.2008.39
Kouki Suzuki, Takashi Nakada, M. Nakanishi, S. Yamashita, Y. Nakashima
{"title":"A Functional Unit with Small Variety of Highly Reliable Cells","authors":"Kouki Suzuki, Takashi Nakada, M. Nakanishi, S. Yamashita, Y. Nakashima","doi":"10.1109/PRDC.2008.39","DOIUrl":"https://doi.org/10.1109/PRDC.2008.39","url":null,"abstract":"Recently, the miniaturization process has brought an increase in transistor variations and in the failure rate at transistors. We propose a small variety of new standard cells. The proposed cells can correct and detect transistor faults. A functional unit with the proposed cells shows better fault tolerance. The area of this unit is approximately 1.4 times that of traditional cells.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133200467","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}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信